Efficient Truthful Scheduling and Resource Allocation through Monitoring
暂无分享,去创建一个
[1] Annamária Kovács,et al. Mechanisms with Monitoring for Truthful RAM Allocation , 2015, WINE.
[2] Venkataraman,et al. RESOURCE ALLOCATION IN COMPETITIVE MULTIAGENT SYSTEMS , 2003 .
[3] Carmine Ventre,et al. Obviously Strategyproof Mechanisms without Money for Scheduling , 2019, AAMAS.
[4] Changyuan Yu,et al. Randomized Truthful Mechanisms for Scheduling Unrelated Machines , 2008, WINE.
[5] Michele Lombardi,et al. Optimal methods for resource allocation and scheduling: a cross-disciplinary survey , 2011, Constraints.
[6] Carmine Ventre,et al. Probabilistic Verification for Obviously Strategyproof Mechanisms , 2018, IJCAI.
[7] Chaitanya Swamy,et al. Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity , 2007, EC '07.
[8] Carmine Ventre,et al. Utilitarian Mechanism Design for Multiobjective Optimization , 2014, SIAM J. Comput..
[9] Kewen Liao,et al. Approximation algorithms for resource allocation optimization. , 2014 .
[10] Edith Elkind,et al. Mechanism design: from partial to probabilistic verification , 2012, EC '12.
[11] Changyuan Yu,et al. An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines , 2008, STACS.
[12] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[13] Dimitris Fotakis,et al. Truthfulness Flooded Domains and the Power of Verification for Mechanism Design , 2013, WINE.
[14] Tim Roughgarden,et al. Black-Box Randomized Reductions in Algorithmic Mechanism Design , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[15] Elias Koutsoupias,et al. The Anarchy of Scheduling Without Money , 2016, SAGT.
[16] Michael E. Saks,et al. Weak monotonicity suffices for truthfulness on convex domains , 2005, EC '05.
[17] Christos Tzamos,et al. On the Power of Deterministic Mechanisms for Facility Location Games , 2014, TEAC.
[18] Martin Hoefer,et al. Truthful mechanism design via correlated tree rounding , 2015, Math. Program..
[19] David B. Shmoys,et al. A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.
[20] Annamária Kovács,et al. On the Nisan-Ronen conjecture for submodular valuations , 2019, STOC.
[21] Carmine Ventre,et al. Truthfulness on a budget: trading money for approximation through monitoring , 2019, Autonomous Agents and Multi-Agent Systems.
[22] Itai Ashlagi,et al. Optimal Lower Bounds for Anonymous Scheduling Mechanisms , 2012, Math. Oper. Res..
[23] Elias Koutsoupias,et al. Scheduling Without Payments , 2011, Theory of Computing Systems.
[24] Aravind Srinivasan,et al. A unified approach to scheduling on unrelated parallel machines , 2009, JACM.
[25] Stefano Leucci,et al. No truthful mechanism can be better than n approximate for two natural problems , 2017, Games Econ. Behav..
[26] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[27] Tim Roughgarden,et al. Optimal mechanism design and money burning , 2008, STOC.
[28] Y. Shoham,et al. Resource allocation in competitive multiagent systems , 2003 .
[29] Evripidis Bampis,et al. Randomized truthful algorithms for scheduling selfish tasks on parallel machines , 2005, Theor. Comput. Sci..
[30] Carmine Ventre,et al. Obvious Strategyproofness Needs Monitoring for Good Approximations , 2017, AAAI.
[31] Carmine Ventre,et al. Optimal collusion-resistant mechanisms with verification , 2009, EC '09.
[32] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[33] Chaitanya Swamy,et al. Truthful mechanism design for multidimensional scheduling via cycle monotonicity , 2009, Games Econ. Behav..
[34] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[35] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[36] Evripidis Bampis,et al. On the truthfulness and the approximation for scheduling selfish tasks , 2007, SPAA '07.