Optimal Strategies in Sequential Bidding
| dc.creator | Apt, Krzysztof R. | |
| dc.creator | Markakis, Vangelis | |
| dc.date | 2008-10-17 | |
| dc.date.accessioned | 2026-07-07T10:11:15Z | |
| dc.date.available | 2026-07-07T10:11:15Z | |
| dc.description | We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the class of feasible and incentive compatible mechanisms were identified. One way to improve upon these optimality results is by allowing the players to move sequentially. With this in mind, we study here sequential versions of two feasible Groves mechanisms used for single item auctions: the Vickrey auction and the Bailey-Cavallo mechanism. Because of the absence of dominant strategies in this sequential setting, we focus on a weaker concept of an optimal strategy. For each mechanism we introduce natural optimal strategies and observe that in each mechanism these strategies exhibit different behaviour. However, we then show that among all optimal strategies, the one we introduce for each mechanism maximizes the social welfare when each player follows it. The resulting social welfare can be larger than the one obtained in the simultaneous setting. Finally, we show that, when interpreting both mechanisms as simultaneous ones, the vectors of the proposed strategies form a Pareto optimal Nash equilibrium in the class of optimal strategies. | |
| dc.description | 26 pages | |
| dc.identifier | https://arxiv.org/abs/0810.3182 | |
| dc.identifier | http://arxiv.org/abs/0810.3182 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/171807 | |
| dc.subject | Computer Science and Game Theory | |
| dc.title | Optimal Strategies in Sequential Bidding | |
| dc.type | text |