Optimal sequential contests

02/13/2018
by   Toomas Hinnosaar, et al.
0

I study sequential contests where the efforts of earlier players may be disclosed to later players by nature or by design. The model has a range of applications, including rent seeking, R&D, oligopoly, public goods provision, and tragedy of the commons. I show that information about other players' efforts increases the total effort. Thus, the total effort is maximized with full transparency and minimized with no transparency. I also study the advantages of moving earlier and the limits of large contests.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2022

Sequential Elimination Contests with All-Pay Auctions

By modeling contests as all-pay auctions, we study two-stage sequential ...
research
04/25/2022

Decentralisation Conscious Players And System Reliability

We propose a game-theoretic model of the reliability of decentralised sy...
research
09/08/2020

The curse of rationality in sequential scheduling games

Despite the emphases on computability issues in research of algorithmic ...
research
06/07/2020

Sharp Thresholds of the Information Cascade Fragility Under a Mismatched Model

We analyze a sequential decision making model in which decision makers (...
research
02/25/2021

Social Welfare Maximization and Conformism via Information Design in Linear-Quadratic-Gaussian Games

We consider linear-quadratic Gaussian (LQG) games in which players have ...
research
05/27/2019

Contest Architecture with Public Disclosures

I study optimal disclosure policies in sequential contests. A contest de...
research
10/27/2017

The Algorithmic-Autoregulation (AA) Methodology and Software: a collective focus on self-transparency

There are numerous efforts to achieve a lightweight and systematic accou...

Please sign up or login with your details

Forgot password? Click here to reset