暂无分享,去创建一个
Bo Li | Minming Li | Xiaowei Wu | Minming Li | Xiaowei Wu | Bo Li
[1] Yossi Azar,et al. Truthful Approximation Mechanisms for Scheduling Selfish Related Machines , 2005, Theory of Computing Systems.
[2] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, EC '09.
[3] Krzysztof Rzadca,et al. Approximation Algorithms for the Multiorganization Scheduling Problem , 2011, IEEE Transactions on Parallel and Distributed Systems.
[4] Leah Epstein,et al. A Unified Approach to Truthful Scheduling on Related Machines , 2012, Math. Oper. Res..
[5] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[6] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[7] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[8] Annamária Kovács,et al. Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines , 2005, ESA.
[9] Rudolf Fleischer,et al. Online Scheduling Revisited , 2000, ESA.
[10] Tim Roughgarden,et al. Almost Envy-Freeness with General Valuations , 2017, SODA.
[11] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[12] Amos Fiat,et al. Makespan Minimization via Posted Prices , 2017, EC.
[13] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..
[14] Elias Koutsoupias,et al. A Lower Bound for Scheduling Mechanisms , 2007, SODA '07.
[15] Annamária Kovács,et al. A deterministic truthful PTAS for scheduling related machines , 2009, SODA '10.
[16] Yuhao Zhang,et al. Online Makespan Minimization: The Power of Restart , 2018, APPROX-RANDOM.
[17] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[18] Bo Chen,et al. Scheduling on identical machines: How good is LPT in an on-line setting? , 1997, Oper. Res. Lett..
[19] John Noga,et al. An optimal online algorithm for scheduling two machines with release times , 2001, Theor. Comput. Sci..
[20] Krzysztof Rzadca,et al. Non-monetary fair scheduling: a cooperative game theory approach , 2013, SPAA.
[21] Marek Karpinski,et al. On-line Load Balancing for Related Machines , 1997, WADS.
[22] Elias Koutsoupias,et al. A Lower Bound of 1+φ for Truthful Scheduling Mechanisms , 2012, Algorithmica.
[23] H. Moulin. Axioms of Cooperative Decision Making , 1988 .
[24] L. S. Shapley,et al. 17. A Value for n-Person Games , 1953 .