Related papers: When "Better" is better than "Best"
We propose an analytically tractable variation of the minority game in which rational agents use probabilistic strategies. In our model, $N$ agents choose between two alternatives repeatedly, and those who are in the minority get a pay-off…
"Guess Who?" is a popular two player game where players ask "Yes"/"No" questions to search for their opponent's secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal…
We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of 'offers' based on…
We carry out a game-theoretic analysis of the recursive game "Guts," a variant of poker featuring repeated play with possibly growing stakes. An interesting aspect of such games is the need to account for funds lost to all players if…
In many game-theoretic settings, agents are challenged with taking decisions against the uncertain behavior exhibited by others. Often, this uncertainty arises from multiple sources, e.g., incomplete information, limited computation,…
We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement…
We study population dynamics under which each revising agent tests each strategy k times, with each trial being against a newly drawn opponent, and chooses the strategy whose mean payoff was highest. When k = 1, defection is globally stable…
The hawk-dove game admits two types of equilibria: an asymmetric pure equilibrium in which players in one population play hawk and players in the other population play dove, and an inefficient symmetric mixed equilibrium, in which hawks are…
We provide a game-theoretic analysis of consensus, assuming that processes are controlled by rational agents and may fail by crashing. We consider agents that \emph{care only about consensus}: that is, (a) an agent's utility depends only on…
Public goods games study the incentives of individuals to contribute to a public good and their behaviors in equilibria. In this paper, we examine a specific type of public goods game where players are networked and each has binary actions,…
Quantum games with incomplete information can be studied within a Bayesian framework. We consider a version of prisoner's dilemma (PD) in this framework with three players and characterize the Nash equilibria. A variation of the standard PD…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval…
We provide an in-depth study of Nash equilibria in multi-objective normal form games (MONFGs), i.e., normal form games with vectorial payoffs. Taking a utility-based approach, we assume that each player's utility can be modelled with a…
In population games, a large population of players, modeled as a continuum, is divided into subpopulations, and the fitness or payoff of each subpopulation depends on the overall population composition. Evolutionary dynamics describe how…
A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…
It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic…
This article explores the interaction of two agents during a geopolitical operation. Collaborative work is considered, rather than being done alone. However, each agent has the goal of maximizing personal net profit. We will have 3…
Subgame perfect equilibria are specific Nash equilibria in perfect information games in extensive form. They are important because they relate to the rationality of the players. They always exist in infinite games with continuous…
We analyze best response dynamics for finding a Nash equilibrium of an infinite horizon zero-sum stochastic linear quadratic dynamic game (LQDG) with partial and asymmetric information. We derive explicit expressions for each player's best…