English
Related papers

Related papers: Restricting Entries to All-Pay Contests

200 papers

Tournaments are frequently used incentive mechanisms to enhance performance. In this paper, we use field data and show that skill disparities among contestants asymmetrically affect the performance of contestants. Skill disparities have…

General Economics · Economics 2024-10-29 Enzo Brox , Daniel Goller

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

Computer Science and Game Theory · Computer Science 2016-02-25 Kai Jin , Pingzhong Tang , Shiteng Chen

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec

We consider a variant of the standard Bayesian mechanism, where players evaluate their outcomes and constraints in an ex-ante manner. Such a model captures a major form of modern online advertising where an advertiser is concerned with…

Computer Science and Game Theory · Computer Science 2022-03-01 Bonan Ni , Pingzhong Tang

In this work the properties of multi choice minority games are studied by means of extensive computational simulations. We have considered several ways of rewarding the strategies of the players and compared the resulting behaviours of the…

Disordered Systems and Neural Networks · Physics 2008-11-23 J. Menche , J. R. L. de Almeida

This paper studies the last-iterate convergence properties of the exponential weights algorithm with constant learning rates. We consider a repeated interaction in discrete time, where each player uses an exponential weights algorithm…

Artificial Intelligence · Computer Science 2024-07-10 Maurizio d'Andrea , Fabien Gensbittel , Jérôme Renault

We consider two-player contests with the possibility of ties and study the effect of different tie-breaking rules on effort. For ratio-form and difference-form contests that admit pure-strategy Nash equilibrium, we find that the effort of…

Theoretical Economics · Economics 2024-02-05 Sumit Goel , Amit Goyal

The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost incurred between occurrences of odd colors and the next occurrence of a larger even one. Such games quantitatively extend parity games…

Logic in Computer Science · Computer Science 2023-06-22 Alexander Weinert , Martin Zimmermann

We study information disclosure policies for contests among groups. Each player endogenously decides whether or not to participate in competition as a member of their group. Within-group aggregation of effort is best-shot, i.e., each…

Theoretical Economics · Economics 2025-03-27 Luke Boosey , Philip Brookins , Dmitry Ryvkin

We compute equilibrium strategies in multi-stage games with continuous signal and action spaces as they are widely used in the management sciences and economics. Examples include sequential sales via auctions, multi-stage elimination…

Computer Science and Game Theory · Computer Science 2024-07-23 Fabian R. Pieroth , Nils Kohring , Martin Bichler

In many applications, we want to influence the decisions of independent agents by designing incentives for their actions. We revisit a fundamental problem in this area, called GAME IMPLEMENTATION: Given a game in standard form and a set of…

Computer Science and Game Theory · Computer Science 2022-12-02 Jiehua Chen , Sebastian Vincent Haydn , Negar Layegh Khavidaki , Sofia Simola , Manuel Sorge

We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…

Economics · Quantitative Finance 2017-04-04 Jian Yang

This paper gives a complete analysis of worst-case equilibria for various versions of weighted congestion games with two players and affine cost functions. The results are exact price of anarchy bounds which are parametric in the weights of…

Computer Science and Game Theory · Computer Science 2022-03-04 Joran van den Bosse , Marc Uetz , Matthias Walter

This paper discusses the gambling contest introduced in Seel & Strack (Gambling in contests, Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 375, Mar 2012.) and considers the impact of adding a penalty…

Portfolio Management · Quantitative Finance 2013-01-07 Han Feng , David Hobson

We conduct a comprehensive analysis of the discrete-time exponential-weights dynamic with a constant step size on all general-sum and symmetric $2 \times 2$ normal-form games, i.e. games with $2$ pure strategies per player, and where the…

Computer Science and Game Theory · Computer Science 2026-01-22 Guanghui Wang , Krishna Acharya , Lokranjan Lakshmikanthan , Juba Ziani , Vidya Muthukumar

Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…

Computer Science and Game Theory · Computer Science 2026-04-21 Davin Choo , Paul W. Goldberg , Nicholas Teh

In this work the properties of minority games containing agents which try to winning all the time are studied by means of computational simulations. We have considered several ways of introducing above the rules clever players using…

Disordered Systems and Neural Networks · Physics 2007-05-23 J. R. L. de Almeida , J. Menche

We show that, by using multiplicative weights in a game-theoretic thought experiment (and an important convexity result on the composition of multiplicative weights with the relative entropy function), a symmetric bimatrix game (that is, a…

Computer Science and Game Theory · Computer Science 2025-04-24 Ioannis Avramopoulos

Assume that a treasure is placed in one of $M$ boxes according to a known distribution and that $k$ searchers are searching for it in parallel during $T$ rounds. We study the question of how to incentivize selfish players so that the…

Computer Science and Game Theory · Computer Science 2020-06-23 Amos Korman , Yoav Rodeh

We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic…

Computer Science and Game Theory · Computer Science 2014-04-21 Elliot Anshelevich , Shreyas Sekar