Mechanisms for Scheduling with Single-Bit Private Values
暂无分享,去创建一个
[1] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[2] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[3] Changyuan Yu,et al. Truthful mechanisms for two-range-values variant of unrelated scheduling , 2009, Theor. Comput. Sci..
[4] Paul G. Spirakis,et al. Algorithmic Game Theory, N. Nisan, T. Roughgarden, È. Tardos, V. Vazirani (Eds.). Cambridge University Press (2007), Foreword by C.H. Papadimitriou , 2009 .
[5] Itai Ashlagi,et al. Optimal Lower Bounds for Anonymous Scheduling Mechanisms , 2012, Math. Oper. Res..
[6] E. H. Clarke. Multipart pricing of public goods , 1971 .
[7] Leah Epstein,et al. A Unified Approach to Truthful Scheduling on Related Machines , 2012, Math. Oper. Res..
[8] Vincenzo Bonifaci,et al. Scheduling Unrelated Machines of Few Different Types , 2012, ArXiv.
[9] Theodore Groves,et al. Incentives in Teams , 1973 .
[10] Elias Koutsoupias,et al. A Lower Bound of 1+φ for Truthful Scheduling Mechanisms , 2012, Algorithmica.
[11] Elias Koutsoupias,et al. A Lower Bound of 1+phi for Truthful Scheduling Mechanisms , 2007, MFCS.
[12] Annamária Kovács,et al. Mechanism design for fractional scheduling on unrelated machines , 2007, TALG.
[13] Pinyan Lu,et al. On 2-Player Randomized Mechanisms for Scheduling , 2009, WINE.
[14] Annamária Kovács,et al. A Deterministic Truthful PTAS for Scheduling Related Machines , 2013, SIAM J. Comput..
[15] J. Rochet. A necessary and sufficient condition for rationalizability in a quasi-linear context , 1987 .
[16] Tim Roughgarden,et al. Truthful Approximation Schemes for Single-Parameter Agents , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[17] Ahuva Mu'alem,et al. Setting lower bounds on truthfulness: extended abstract , 2007, SODA.
[18] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[19] Elias Koutsoupias,et al. A Lower Bound for Scheduling Mechanisms , 2007, SODA '07.
[20] Itai Ashlagi,et al. An optimal lower bound for anonymous scheduling mechanisms , 2009, EC '09.
[21] Changyuan Yu,et al. An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines , 2008, STACS.
[22] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[23] Changyuan Yu,et al. Randomized Truthful Mechanisms for Scheduling Unrelated Machines , 2008, WINE.
[24] Chaitanya Swamy,et al. Truthful mechanism design for multidimensional scheduling via cycle monotonicity , 2009, Games Econ. Behav..