Anastasia Antsygina

1. Optimal Allocation of Multi-Dimensional Prizes in Contests with Heterogeneous Agents – submitted

We develop a model where two players with asymmetric preferences engage in a contest game. The key novelty is the introduction of multi-dimensional rewards. We characterize the optimal prize allocation that maximizes aggregate effort. When heterogeneity in preferences is strong and the designer cannot assign identity-dependent prizes, the loser must get a positive reward, which is in stark contrast to the existing literature. Such allocation eliminates the advantage of the stronger competitor and incentivizes the opponent to exert more effort (the equilibrium effect). Using data from twelve professional tennis competitions where prizes include money and the ATP ranking points, we test our theoretical predictions empirically. The identification strategy relies on exogenous variation in prizes over both dimensions and random matching between the players. We document the equilibrium effect in the data and recover the underlying preference profiles that define its direction.

2. Information Disclosure in Contests with Communication – submitted

We study optimal information disclosure in static contests where players do not know their own values of winning but can learn them, publicly or privately, from the designer. The designer chooses a disclosure policy that maximizes the total expected effort, and commits to it before observing the realized value profile. A distinct feature of our model is that conditional on receiving private information from the designer, contestants can communicate with each other. We show that the contestants share their private information if and only if the values of winning are positively correlated. Since communication can result in an asymmetric contest associated with lower expected effort, the designer prefers concealment to any other disclosure policy available. This result is in a stark contrast with the no communication benchmark where private disclosure is best when the values of winning are sufficiently positively correlated.

3. Optimal Information Disclosure in Competing Contests with Capacity Constrained Players – submitted 

This paper studies optimal information disclosure in competing contests with identical players. Each player faces a capacity constraint on the total effort contribution and is ex ante uninformed about the difficulty of the task to be performed in one of the contests. The task can be either difficult (associated with a high effort cost) or easy (associated with a low effort cost). Before the game starts, the designer of a contest with the unknown task can commit to (1) fully disclose the task type or to (2) keep it private in order to maximize the aggregate effort exerted in her competition. When the capacity constraint is slack, the game between contests is equivalent to the non-competitive case. Otherwise, the contests become linked, and there is a substitution effect which forces the players to reallocated their effort to a competition they perceive as easiest. If the difficult task is sufficiently costly, then full disclosure generates substantial competitive gains from revealing the easy task and, hence, mitigates the substitution effect. When the cost of performing a difficult task declines, full disclosure results in significant competitive losses from revealing the difficult task to the contestants, and concealment turns to be more attractive.

Adverse Selection in Job Promotion Contests with Multi-Dimensional Skills (with Anna Ponomarenko)

When Justice is Hurried and When is it Buried? Wealth Inequality and the Duration of Cases in Court (with Madina Kurmangaliyeva)

Efficient Alliance Formation in Contests (with Mariya Teteryatnikova)

September 2011– August 2017: Teaching Assistant, Department of Econometrics and Statistics, HSEM, UrFU (Ekaterinburg, Russia)

September 2016 – May 2017: Teaching Assistant for Prof. Filippo Taddei, The Johns Hopkins University, SAIS Europe (Bologna, Italy)

https://sites.google.com/site/aantsygi/home-1