Related papers: Optimal Sequential Contests
A new model of collusions in an organization is proposed. Each actor $a_{i=1,\cdots,N}$ disposes one unique good $g_{j=1,\cdots,N}$. Each actor $a_i$ has also a list of other goods which he/she needs, in order from desired most to those…
We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the…
We analyze the dynamics of competitions with a large number of players. In our model, n players compete against each other and the winner is decided based on the standings: in each competition, the mth ranked player wins. We solve for the…
We study noncooperative games, in which each player's objective is composed of a sequence of ordered- and potentially conflicting-preferences. Problems of this type naturally model a wide variety of scenarios: for example, drivers at a busy…
In competitive adversarial environments, it is often advantageous to obfuscate one's strategies or capabilities. However, revealing one's strategic intentions may shift the dynamics of the competition in complex ways. Can it ever be…
Cooperation and competition are fundamental forces shaping both natural and human systems, yet their interplay remains poorly understood. The Prisoner's Dilemma Game (PDG) has long served as a foundational framework in Game Theory for…
When users lack specific knowledge of various system parameters, their uncertainty may lead them to make undesirable deviations in their decision making. To alleviate this, an informed system operator may elect to signal information to…
The allocation of resources plays an important role in the completion of system objectives and tasks, especially in the presence of strategic adversaries. Optimal allocation strategies are becoming increasingly more complex, given that…
The paper discusses the strategy-proofness of sports tournaments with multiple group stages, where the results of matches already played in the previous round against teams in the same group are carried over. These tournaments, widely used…
Cooperative game theory has diverse applications in contemporary artificial intelligence, including domains like interpretable machine learning, resource allocation, and collaborative decision-making. However, specifying a cooperative game…
In this work we present and analyze a fluid-mechanical model of competition (scavenging) amongst $N$ liquid droplets (individual competitors). The eventual outcome of this competition depends sensitively on the average resource (volume) per…
We consider a model of oligopolistic competition in a market with search frictions, in which competing firms with products of unknown quality advertise how much information a consumer's visit will glean. In the unique symmetric equilibrium…
In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is…
A competitive learning model was introduced in Ref. 1 (A. Mehta and J. M. Luck, Phys. Rev. E 60, 5, 1999), in which the learning is outcome-related. Every individual chooses between a pair of existing strategies or types, guided by a…
Sharing systems have facilitated the redistribution of underused resources by providing convenient online marketplaces for individual sellers and buyers. However, sellers in these systems may not fully disclose the information of their…
Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…
Sequential search models provide a powerful framework for studying consumer search using rich data that records the sequence of consumer actions taken during the search process. In existing empirical applications, their implementation often…
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…
Agents exert hidden effort to produce randomly-sized innovations in a technology they share. Flow payoffs grow as the technology develops, but so does the marginal cost of effort. I characterise the unique symmetric MPE with the quality of…
We study a distributed allocation process where, repeatedly in time, every player renegotiates past allocations with neighbors and allocates new revenues. The average allocations evolve according to a doubly (over time and space) averaging…