Sequential pivotal mechanisms for public project problems
| Authors |
|
|---|---|
| Publication date | 2009 |
| Host editors |
|
| Book title | Algorithmic Game Theory |
| Book subtitle | Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009 : proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | Second International Symposium on Algorithmic Game Theory (SAGT 2009), Paphos, Cyprus |
| Pages (from-to) | 85-96 |
| Publisher | Berlin: Springer |
| Organisations |
|
| Abstract |
It is well-known that for several natural decision problems no budget balanced Groves mechanisms exist. This has motivated recent research on designing variants of feasible Groves mechanisms (termed as ‘redistribution of VCG (Vickrey-Clarke-Groves) payments’) that generate reduced deficit. With this in mind, we study sequential mechanisms and consider optimal strategies that could reduce the deficit resulting under the simultaneous mechanism. We show that such strategies exist for the sequential pivotal mechanism of the well-known public project problem. We also exhibit an optimal strategy with the property that a maximal social welfare is generated when each player follows it. Finally, we show that these strategies can be achieved by an implementation in Nash equilibrium. All proofs can be found in the full version posted in Computing Research Repository (CoRR), http://arxiv.org/abs/0810.1383
|
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1007/978-3-642-04645-2_9 |
| Permalink to this page | |