Dynamic contests with resource constraints

DOI10.1007/s00355-012-0711-1zbMath1288.91115OpenAlexW1981235437MaRDI QIDQ2453401

Eyal Erez, Aner Sela

Publication date: 6 June 2014

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00355-012-0711-1

Mathematics Subject Classification ID

History, political science (91F10) Auctions, bargaining, bidding and selling, and other market models (91B26) Multistage and repeated games (91A20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (11)

Optimal stealing time ⋮ Effort allocations in elimination tournaments ⋮ Fatigue accumulation in dynamic contests ⋮ Proportional resource allocation in dynamic \(n\)-player Blotto games ⋮ Is there free riding in group contests? ⋮ Resource allocations in the best-of-\(k\) (\(k=2, 3\)) contests ⋮ Hierarchical models of warfare ⋮ The dynamics of Majoritarian Blotto games ⋮ Sequential contests with first and secondary prizes ⋮ Two-stage contests with effort-dependent values of winning ⋮ Round-robin tournaments with limited resources

Cites Work

• The optimal multi-stage contest
• Contests with limited resources
• Competitive burnout: theory and experimental evidence
• Discrete Colonel Blotto and general lotto games
• Contest architecture
• The Colonel Blotto game
• Election Goals and the Allocation of Campaign Resources
• The Theory of Play and Integral Equations with Skew Symmetric Kernels

This page was built for publication: Dynamic contests with resource constraints