MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

All-Pay Auctions with Different Forfeits

Author(s)
Kang, Benjamin; Unwin, James
Thumbnail
Downloadgames-17-00002-v2.pdf (304.7Kb)
Publisher with Creative Commons License

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution https://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Abstract
In an auction, each party bids a certain amount, and the one who bids the highest is the winner. Interestingly, auctions can also be used as models for other real-world systems. In an all-pay auction all parties must pay a forfeit for bidding. In the most commonly studied all-pay auction, parties forfeit their entire bid, and this has been considered as a model for expenditure on political campaigns. Here, we consider a number of alternative forfeits that might be used as models for different real-world competitions, such as preparing bids for defense or infrastructure contracts.
Date issued
2026-01-09
URI
https://hdl.handle.net/1721.1/164983
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Games
Publisher
Multidisciplinary Digital Publishing Institute
Citation
Kang, Benjamin, and James Unwin. 2026. "All-Pay Auctions with Different Forfeits" Games 17, no. 1: 2.
Version: Final published version

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.