Optimal Lower Bounds for Anonymous Scheduling Mechanisms
暂无分享,去创建一个
[1] Amos Fiat,et al. Derandomization of auctions , 2005, STOC '05.
[2] Elias Koutsoupias,et al. A Lower Bound for Scheduling Mechanisms , 2007, SODA '07.
[3] Elias Koutsoupias,et al. A Lower Bound of 1+phi for Truthful Scheduling Mechanisms , 2007, MFCS.
[4] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[5] S. Bikhchandani,et al. Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation , 2006 .
[6] Shimon Even,et al. Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .
[7] Shahar Dobzinski,et al. On characterizations of truthful mechanisms for combinatorial auctions and scheduling , 2008, EC '08.
[8] Elias Koutsoupias,et al. A characterization of 2-player mechanisms for scheduling , 2008, ESA.
[9] Chaitanya Swamy,et al. Truthful mechanism design for multidimensional scheduling via cycle monotonicity , 2009, Games Econ. Behav..
[10] Annamária Kovács,et al. A deterministic truthful PTAS for scheduling related machines , 2009, SODA '10.
[11] Changyuan Yu,et al. Truthful mechanisms for two-range-values variant of unrelated scheduling , 2009, Theor. Comput. Sci..
[12] Annamária Kovács,et al. Mechanism Design for Fractional Scheduling on Unrelated Machines , 2007, ICALP.
[13] Annamária Kovács,et al. Mechanism design for fractional scheduling on unrelated machines , 2007, TALG.
[14] Ahuva Mu'alem,et al. Setting lower bounds on truthfulness: extended abstract , 2007, SODA.
[15] Tim Roughgarden,et al. Truthful Approximation Schemes for Single-Parameter Agents , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.