Abstract
We consider the problem of designing mechanisms with the incentive property that no coalition of agents can engage in a collusive strategy that results in an increase in the combined utility of the coalition. For single parameter agents, we give a characterization that essentially restricts such mechanisms to those that post a "take it or leave it" price to for each agent in advance. We then consider relaxing the incentive property to only hold with high probability. In this relaxed model, we are able to design approximate profit maximizing auctions and approximately efficient auctions. We generalized these results to give a methodology for designing collusion resistant mechanisms for single parameter agents. In addition, we give several results for a weaker incentive property from the literature known as group strat-egyproofness.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
Pages | 620-629 |
Number of pages | 10 |
State | Published - Jul 1 2005 |
Event | Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States Duration: Jan 23 2005 → Jan 25 2005 |
Other
Other | Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
Country/Territory | United States |
City | Vancouver, BC |
Period | 1/23/05 → 1/25/05 |
ASJC Scopus subject areas
- Software
- General Mathematics