Name
Abstract | ||
|---|---|---|
Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA). Traditional analysis of these mechanisms---in particular, their truth revelation properties---assumes that the optimization problems are solved precisely. In reality, these optimization problems can usually be solved only in an approximate fashion. We investigate the impact on such mechanisms of replacing exact solutions by approximate ones. Specifically, we look at a particular greedy optimization method. We show that the GVA payment scheme does not provide for a truth revealing mechanism. We introduce another scheme that does guarantee truthfulness for a restricted class of players. We demonstrate the latter property by identifying natural properties for combinatorial auctions and showing that, for our restricted class of players, they imply that truthful strategies are dominant. Those properties have applicability beyond the specific auction studied. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1145/585265.585266 | J. ACM |
Keywords | DocType | Volume |
combinatorial auctions,computational complexity,mechanism design | Journal | 49 |
Issue | ISSN | ISBN |
5 | 0004-5411 | 1-58113-176-3 |
Citations | PageRank | References |
416 | 64.06 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Lehmann | 1 | 1270 | 330.79 |
| Liadan O'Callaghan | 2 | 1271 | 111.97 |
| Yoav Shoham | 3 | 5530 | 764.00 |