Related papers: General Lotto Games with Scouts: Information versu…
Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says "Heads" or "Tails". The team wins if all four choices match; otherwise the Devil wins. If all team…
In competitive resource allocation formulations multiple agents compete over different contests by committing their limited resources in them. For these settings, contest games offer a game-theoretic foundation to analyze how players can…
We study games with incomplete information and characterize when a feasible outcome is Pareto efficient. Outcomes with excessive randomization are inefficient: generically, the total number of action profiles across states must be strictly…
In this manuscript we explore the onset of cooperative traits in the Public Goods game. This well-known game involves N-agent interactions and thus reproduces a large number of social scenarios in which cooperation appears to be essential.…
Matching games is a one-to-one two sided market model introduced by Garrido-Lucero and Laraki, in which coupled agents' utilities are endogenously determined as the outcome of a strategic game. They refine the classical pairwise stability…
We extend concurrent game structures (CGSs) with a simple notion of preference over computations and define a minimal notion of rationality for agents based on the concept of dominance. We use this notion to interpret a CL and an ATL…
This paper presents a potential game approach for distributed cooperative selection of informative sensors, when the goal is to maximize the mutual information between the measurement variables and the quantities of interest. It is proved…
We establish fundamental connections between utility theories of wealth from the economic sciences and information-theoretic quantities. In particular, we introduce operational tasks based on betting where both gambler and bookmaker have…
The multiplication game is a two-person game in which each player chooses a positive integer without knowledge of the other player's number. The two numbers are then multiplied together and the first digit of the product determines the…
We show that, in large population games, decentralized information aggregation generically corrects for individual-level biases. This establishes a new testable aggregate efficiency benchmark where the behavior of boundedly rational agents…
The Labouchere gambling system is hypothesized to increase the probability of winning a predetermined arbitrary profit in a gambling system such as a coin flip or a roulette game in which both payouts and odds are 1:1. However, use of the…
Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…
For zero-sum two-player continuous-time games with integral payoff and incomplete information on one side, one shows that the optimal strategy of the informed player can be computed through an auxiliary optimization problem over some…
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…
We study a two-player model of conflict with multiple battlefields -- the novel element is that each of the players has their own network of spillovers so that resources allocated to one battle can be utilized in winning neighboring…
Online gambling sites offer many different gambling games. In this work we analyse the gambling logs of numerous solely probability-based gambling games and extract the wager and odds distributions. We find that the log-normal distribution…
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, B\"uchi and co-B\"uchi objectives, and investigate the existence of…
When multiple agents are engaged in a network of conflict, some can advance their competitive positions by forming alliances with each other. However, the costs associated with establishing an alliance may outweigh the potential benefits.…
This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…
The Colonel Blotto game is a deeply studied theoretical model for competitive allocation environments including elections, advertising, and ecology. However, the original formulation of Colonel Blotto has had few practical implications due…