EconPapers    
Economics at your fingertips  
 

Simultaneous All-Pay Auctions with Budget Constraints

Yan Liu, Ying Qin and Zihe Wang

Papers from arXiv.org

Abstract: The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However, in the traditional all-pay auction, players have no budget constraints, whereas in real-world scenarios, players typically face budget constraints. This paper studies the Nash equilibrium of two players with budget constraints across multiple heterogeneous items in a complete-information framework. The main contributions are as follows: (1) a comprehensive characterization of the Nash equilibrium in single-item auctions with asymmetric budgets and valuations; (2) the construction of a joint distribution Nash equilibrium for the two-item scenario; and (3) the construction of a joint distribution Nash equilibrium for the three-item scenario. Unlike the unconstrained all-pay auction, which always has a Nash equilibrium, a Nash equilibrium may not exist when players have budget constraints. Our findings highlight the intricate effects of budget constraints on bidding strategies, providing new perspectives and methodologies for theoretical analysis and practical applications of all-pay auctions.

Date: 2025-05
New Economics Papers: this item is included in nep-des, nep-mic and nep-spo
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2505.03291 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2505.03291

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().

 
Page updated 2025-06-17
Handle: RePEc:arx:papers:2505.03291