In this paper, we seek to design a Groves mechanism for assigning p heterogeneous objects among n competing agents (n∈>∈p) with unit demand, satisfying weak budget balance, individual rationality, and minimizing the budget imbalance. This calls for designing an appropriate rebate function. When the objects are identical, this problem has been solved by Moulin [1] and Guo and Conitzer [2]. However, it remains an open problem to design such a rebate function when the objects are heterogeneous. We propose a mechanism, HETERO and conjecture that HETERO is individually rational and weakly budget balanced. We provide empirical evidence for our conjecture through experimental simulations. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Gujar, S., & Yadati, N. (2008). Redistribution of VCG payments in assignment of heterogeneous objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5385 LNCS, pp. 438–445). https://doi.org/10.1007/978-3-540-92185-1_49
Mendeley helps you to discover research relevant for your work.