Follow
Mingwei Yang
Mingwei Yang
Stanford University
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
A provably good and practically efficient algorithm for common path pessimism removal in large designs
Z Guo, M Yang, TW Huang, Y Lin
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2021
182021
Streaming facility location in high dimension via geometric hashing
A Czumaj, SHC Jiang, R Krauthgamer, P Veselý, M Yang
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
122022
On the re-solving heuristic for (binary) contextual bandits with knapsacks
R Ai, Z Chen, X Deng, Y Pan, C Wang, M Yang
arXiv preprint arXiv:2211.13952, 2022
22022
Fairly allocating (contiguous) dynamic indivisible items with few adjustments
M Yang
arXiv preprint arXiv:2209.03286, 2022
22022
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation
X Bei, B Tao, J Wu, M Yang
arXiv preprint arXiv:2308.08903, 2023
12023
Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail
B Tao, M Yang
arXiv preprint arXiv:2306.15920, 2023
12023
Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties
Z Chen, M Yang, C Wang, J Li, Z Cai, Y Ren, Z Zhu, X Deng
Proceedings of the ACM on Web Conference 2024, 14-24, 2024
2024
Contextual Bandits with Knapsacks beyond Worst Cases via Re-Solving
R Ai, Z Chen, X Deng, Y Pan, C Wang, M Yang
The system can't perform the operation now. Try again later.
Articles 1–8