Related papers: Competition among Pairwise Lottery Contests
Algorithm design and analysis is a cornerstone of computer science, but it confronts a major challenge. Proving an algorithm's performance guarantee across all inputs has traditionally required extensive and often error-prone human effort.…
Perfect Bayesian Equilibrium (PBE) is a refinement of the Nash equilibrium for imperfect-information extensive-form games (EFGs) that enforces consistency between the two components of a solution: agents' strategy profile describing their…
Nash equilibria provide a principled framework for modeling interactions in multi-agent decision-making and control. However, many equilibrium-seeking methods implicitly assume that each agent has access to the other agents' objectives and…
In this paper, we address the challenge of Nash equilibrium (NE) seeking in non-cooperative convex games with partial-decision information. We propose a distributed algorithm, where each agent refines its strategy through projected-gradient…
This paper proposes a dynamic research contest, namely chasing contest, in which two asymmetric contestants exert costly effort to accomplish two breakthroughs. The contestants are asymmetric in that one of them is present-biased and has…
Many real-world domains contain multiple agents behaving strategically with probabilistic transitions and uncertain (potentially infinite) duration. Such settings can be modeled as stochastic games. While algorithms have been developed for…
We introduce a new algorithm for the numerical computation of Nash equilibria of competitive two-player games. Our method is a natural generalization of gradient descent to the two-player setting where the update is given by the Nash…
We consider the problem of modeling competitive diffusion in real world social networks via the notion of ChoiceGAPs which combine choice logic programs due to Sacca` and Zaniolo and Generalized Annotated Programs due to Kifer and…
The goal in this paper is to approximate the Price of Stability (PoS) in stochastic Nash games using stochastic approximation (SA) schemes. PoS is amongst the most popular metrics in game theory and provides an avenue for estimating the…
This paper investigates stochastic generalized dynamic games with coupling chance constraints, where agents have incomplete information about uncertainties satisfying a concentration of measure property. This problem, in general, is…
We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…
In Hotelling's model of spatial competition, a unit mass of voters is distributed in the interval $[0,1]$ (with their location corresponding to their political persuasion), and each of $m$ candidates selects as a strategy his distinct…
We consider a periodic double auction (PDA) wherein the main participants are wholesale suppliers and brokers representing retailers. The suppliers are represented by a composite supply curve and the brokers are represented by individual…
Peer-evaluation and selection systems are used when sets of agents evaluate each other in order to select the best $k$ among them. These are commonly used in real-world settings, including academic conferences where those reviewing papers…
The Kelly or proportional allocation mechanism is a simple and efficient auction-based scheme that distributes an infinitely divisible resource proportionally to the agents bids. When agents are aware of the allocation rule, their…
This paper deals with the complexity of the problem of computing a pure Nash equilibrium for discrete preference games and network coordination games beyond $O(\log n)$-treewidth and tree metric spaces. First, we estimate the number of…
We study competition between wireless devices with incomplete information about their opponents. We model such interactions as Bayesian interference games. Each wireless device selects a power profile over the entire available bandwidth to…
The Adjusted Winner procedure is an important fair division mechanism proposed by Brams and Taylor for allocating goods between two parties. It has been used in practice for divorce settlements and analyzing political disputes. Assuming…
A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an $\epsilon$-Nash equilibrium if no player can gain more than $\epsilon$ by…
Autonomous racing extends beyond the challenge of controlling a racecar at its physical limits. Professional racers employ strategic maneuvers to outwit other competing opponents to secure victory. While modern control algorithms can…