Bidder optimal assignments for general utilities

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions u(i,j)(p(j)) expressing his utility of being matched to item j at price p(j). For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and non-continuous. We give sufficient conditions under which every mechanism that finds a bidder optimal outcome is incentive compatible. We also give a mechanism that finds a bidder optimal outcome if the conditions for incentive compatibility are satisfied. The running time of this mechanism is exponential in the number of items, but polynomial in the number of bidders. (C) 2013 Elsevier B.V. All rights reserved.


Published in:
Theoretical Computer Science, 478, 22-32
Year:
2013
Publisher:
Amsterdam, Elsevier Science Bv
ISSN:
0304-3975
Keywords:
Laboratories:




 Record created 2013-05-13, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)