Tolerable manipulability in dynamic assignment without money

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2010, Pages 947-952

  Zou, James ^a   Gujar, Sujit ^b   Parkes, David ^a  

^a HARVARD UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; EFFICIENCY; PARETO PRINCIPLE;

DYNAMIC ALLOCATIONS; DYNAMIC ASSIGNMENT; EX ANTES; INACCURATE INFORMATION; MANIPULABILITY; PARETO-EFFICIENT; SCORING RULES; STRATEGY PROOFS;

DYNAMICS;

EID: 77958606304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Abdulkadiroglu, A., and Loertscher, S. 2005. Dynamic house allocations. Technical report, Dept. of Economics, Columbia Univ.
2. Budish, E., and Cantillon, E. 2009. Strategic behavior in multi-unit assignment problems: Lessons for market design. Technical report, Harvard Business School.
3. Conitzer, V., and Sandholm, T. 2004. Computational criticisms of the revelation principle. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC-04), 262-263. (Short paper).
4. Feigenbaum, J., and Shenker, S. 2002. Distributed algorithmic mechanism design: Recent results and future directions. In Proc. of the 6th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, 1-13.
5. Hentenryck, P. V., and Bent, R. 2006. Online Stochastic Combinatorial Optimization. MIT Press.
6. Kurino, M. 2009. House allocation with overlapping agents: A dynamic mechanism design approach. Technical report, Department of Economics, University of Pittsburgh.
7. Lavi, R., and Nisan, N. 2005. Online ascending auctions for gradually expiring goods. In SODA.
8. Othman, A., and Sandholm, T. 2009. Better with Byzantine: Manipulation-Optimal mechanisms. In Second International Symposium on Algorithmic Game Theory (SAGT).
9. Papai, S. 2001. Strategyproof and nonbossy multiple assignments. Journal of Public Economic Theory 3(3):257-71.
10. Parkes, D. C. 2007. Online mechanisms. In Nisan, N.; Rough-garden, T.; Tardos, E.; and Vazirani, V., eds., Algorithmic Game Theory. Cambridge University Press, chapter 16.
11. Svensson, L.-G. 1999. Strategy-proof allocation of indivisible goods. Social Choice and Welfare 16(4):557-567.