Mingwei Yang

Orcid: 0000-0003-1675-0749

Affiliations:
  • Stanford University, Department of Management Science and Engineering, Stanford, CA, USA
  • Peking University, Center on Frontiers of Computing Studies (CFCS), Beijing, China


According to our database1, Mingwei Yang authored at least 17 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Online Metric Matching: Beyond the Worst Case.
Oper. Res., 2026

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Achieving constant regret for dynamic matching via state-independent policies.
CoRR, March, 2025

The incentive guarantees behind Nash welfare in divisible resources allocation.
Artif. Intell., 2025

Incentive Analysis of Collusion in Fair Division.
Proceedings of the Web and Internet Economics - 21st International Conference, 2025

When is Truthfully Allocating Chores No Harder Than Goods?
Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

2024
Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties.
Proceedings of the ACM on Web Conference 2024, 2024

Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond.
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

Stochastic Online Metric Matching: Adversarial Is No Harder Than Stochastic.
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

Contextual Decision-Making with Knapsacks Beyond the Worst Case.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail.
CoRR, 2023

Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
A Provably Good and Practically Efficient Algorithm for Common Path Pessimism Removal in Large Designs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

On the Re-Solving Heuristic for (Binary) Contextual Bandits with Knapsacks.
CoRR, 2022

Streaming Facility Location in High Dimension via New Geometric Hashing.
CoRR, 2022

Budget-Constrained Auctions with Unassured Priors.
CoRR, 2022

Streaming Facility Location in High Dimension via Geometric Hashing.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022


  Loading...