TY - GEN
T1 - Spiteful bidding in the dollar auction
AU - Waniek, Marcin
AU - Nies̈cieruk, Agata
AU - Michalak, Tomasz
AU - Rahwan, Talal
N1 - Publisher Copyright:
Copyright © 2015, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
PY - 2015
Y1 - 2015
N2 - Shubik's dollar auction is a simple yet powerful auction model that aims to shed light on the motives and dynamics of conflict escalation. Technically, a dollar auction is a two-player all-pay auction, where the players compete for a dollar. Common intuition suggests that the dollar auction is a trap. Both players may substantially overbid since, at any stage, leaving the auction leads to a certain loss. On the other hand, bidding further gives a chance to win the prize and, at least, minimize losses. However, O'Neill [8] proved that the dollar auction has a surprising solution in pure strategies. In particular, assuming the budgets of players are finite, only one player bids and wins the prize. Does this mean that the conflict in the dollar auction does not escalate after all? In research we reconsider O'Neill's results following recent literature on spiteful bidders. We ask the question whether the escalation in the dollar auction can be induced by human meanness. Our results confirm this conjecture in various scenarios. A spiteful player is often able to escalate the auction and force the non-spiteful opponent to spend most of the budget. Still, it is the spiteful bidder who wins the prize.
AB - Shubik's dollar auction is a simple yet powerful auction model that aims to shed light on the motives and dynamics of conflict escalation. Technically, a dollar auction is a two-player all-pay auction, where the players compete for a dollar. Common intuition suggests that the dollar auction is a trap. Both players may substantially overbid since, at any stage, leaving the auction leads to a certain loss. On the other hand, bidding further gives a chance to win the prize and, at least, minimize losses. However, O'Neill [8] proved that the dollar auction has a surprising solution in pure strategies. In particular, assuming the budgets of players are finite, only one player bids and wins the prize. Does this mean that the conflict in the dollar auction does not escalate after all? In research we reconsider O'Neill's results following recent literature on spiteful bidders. We ask the question whether the escalation in the dollar auction can be induced by human meanness. Our results confirm this conjecture in various scenarios. A spiteful player is often able to escalate the auction and force the non-spiteful opponent to spend most of the budget. Still, it is the spiteful bidder who wins the prize.
KW - Conflict escalation
KW - Spite
KW - The dollar auction
UR - http://www.scopus.com/inward/record.url?scp=84944682459&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944682459&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84944682459
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1893
EP - 1894
BT - AAMAS 2015 - Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems
A2 - Bordini, Rafael H.
A2 - Yolum, Pinar
A2 - Elkind, Edith
A2 - Weiss, Gerhard
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015
Y2 - 4 May 2015 through 8 May 2015
ER -