Related papers: Where to stand when playing darts?

We consider a single species reaction diffusion system on a two dimensional lattice where the particles $A$ are biased to move towards their nearest neighbours and annihilate as they meet; $A + A \to \emptyset$. Allowing the bias to take…

Originating in evolutionary game theory, the class of "zero-determinant" strategies enables a player to unilaterally enforce linear payoff relationships in simple repeated games. An upshot of this kind of payoff constraint is that it can…

In basketball, every time the offense produces a shot opportunity the player with the ball must decide whether the shot is worth taking. In this paper, I explore the question of when a team should shoot and when they should pass up the shot…

We study a coordination game motivated by the formation of Internet Exchange Points (IXPs), in which agents choose which facilities to join. Joining the same facility as other agents you communicate with has benefits, but different…

We study the outcomes of various positions of the game Snort. When played on graphs admitting an automorphism of order two that maps vertices outside of their closed neighbourhoods (called opposable graphs), the second player has a winning…

We study a class of finite-action disclosure games in which the sender's preferences are state-independent and the receiver's optimal action depends only on the expected state. While receiver-preferred equilibria in these games involve full…

The behaviour of multi-agent learning in competitive settings is often considered under the restrictive assumption of a zero-sum game. Only under this strict requirement is the behaviour of learning well understood; beyond this, learning…

We study the distributed facility location problem, where a set of agents with positions on the line of real numbers are partitioned into disjoint districts, and the goal is to choose a point to satisfy certain criteria, such as optimize an…

The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount…

Consider an agent exploring an unknown graph in search of some goal state. As it walks around the graph, it learns the nodes and their neighbors. The agent only knows where the goal state is when it reaches it. How do we reach this goal…

We analyze, both analytically and numerically, the self-organization of a system of "selfish" adaptive agents playing an arbitrary iterated pairwise game (defined by a 2X2 payoff matrix). Examples of possible games to play are: the…

The sequence of moves in a dynamic team tournament may distort the ex-ante winning probabilities and harm efficiency. This paper compares seven soccer penalty shootout rules that determine the kicking order, from a theoretical perspective.…

Consider a stream of $n$ random points (say, from the unit square) arriving one by one, where a player has to make an irreversible immediate decision for each arriving point whether to pick it. The player has to pick a single point, and the…

To take advantage of strategy commitment, a useful tactic of playing games, a leader must learn enough information about the follower's payoff function. However, this leaves the follower a chance to provide fake information and influence…

Every quasi-attractor of an iterated function system (IFS) of continuous functions on a first-countable Hausdorff topological space is renderable by the probabilistic chaos game. By contrast, we prove that the backward minimality is a…

We study a wireless jamming problem consisting of the competition between a legitimate receiver and a jammer, as a zero-sum game where the value to maximize/minimize is the channel capacity at the receiver's side. Most of the approaches…

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of…

In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a…