Truthful Many-to-Many Assignment with Private Weights
暂无分享,去创建一个
[1] G. Thompson,et al. The Theory of Committees and Elections. , 1959 .
[2] Evripidis Bampis,et al. Randomized truthful algorithms for scheduling selfish tasks on parallel machines , 2005, Theor. Comput. Sci..
[3] Yossi Azar,et al. Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings , 2006, ESA.
[4] David Avis,et al. A survey of heuristics for the weighted matching problem , 1983, Networks.
[5] Patrice Perny,et al. Infinite order Lorenz dominance for fair multiagent optimization , 2010, AAMAS.
[6] J. Lang,et al. EQUITABLE ALLOCATION OF EARTH OBSERVING SATELLITES RESOURCES , 2003 .
[7] Kurt Mehlhorn,et al. Assigning Papers to Referees , 2009, Algorithmica.
[8] S. Boicheva. Mechanism Design without Money , 2012 .
[9] O. Gross. THE BOTTLENECK ASSIGNMENT PROBLEM , 1959 .
[10] R. Vohra,et al. Algorithmic Game Theory: Mechanism Design without Money , 2007 .
[11] Carmine Ventre,et al. Optimal collusion-resistant mechanisms with verification , 2009, EC '09.
[12] Elias Koutsoupias,et al. Scheduling Without Payments , 2011, Theory of Computing Systems.
[13] Carmine Ventre,et al. Combinatorial auctions with verification are tractable , 2010, Theor. Comput. Sci..
[14] Shaddin Dughmi,et al. Truthful assignment without money , 2010, EC '10.
[15] Julián Mestre,et al. Greedy in Approximation Algorithms , 2006, ESA.
[16] Mark de Berg,et al. Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I , 2010, ESA.
[17] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[18] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[19] Patrice Perny,et al. LP Solvable Models for Multiagent Fair Allocation Problems , 2010, ECAI.