Related papers: Where to stand when playing darts?
We introduce a way to compare actions in decision problems. One action is safer than another if the set of beliefs at which the decision-maker prefers the safer action expands as the decision-maker becomes more risk averse. We provide a…
Dynamical properties are studied for escaping particles, injected through a hole in an oval billiard. The dynamics is considered for both static and periodically moving boundaries. For the static boundary, two different decays for the…
For a set-valued function $F$ on a compact subset $W$ of a manifold, spanning is a topological property that implies that $F(x) \ne 0$ for interior points $x$ of $W$. A myopic equilibrium applies when for each action there is a payoff whose…
We have studied a spatially extended snowdrift game, in which the players are located on the sites of two-dimensional square lattices and repeatedly have to choose one of the two strategies, either cooperation (C) or defection (D). A player…
We introduce a formal notion of defendability against backdoors using a game between an attacker and a defender. In this game, the attacker modifies a function to behave differently on a particular input known as the "trigger", while…
The main theorem of this paper establishes conditions under which the "chaos game" algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non contractive iterated…
We study learning dynamics induced by strategic agents who repeatedly play a game with an unknown payoff-relevant parameter. In each step, an information system estimates a belief distribution of the parameter based on the players'…
Mixed extension has played an important role in game theory, especially in the proof of the existence of Nash equilibria in strategic form games. Mixed extension can be regarded as continuous relaxation of a strategic form game. Recently,…
This paper is concerned with the death-birth updating process. This model is an example of a spatial game in which players located on the~$d$-dimensional integer lattice are characterized by one of two possible strategies and update their…
The paper studies the convergence properties of (continuous) best-response dynamics from game theory. Despite their fundamental role in game theory, best-response dynamics are poorly understood in many games of interest due to the…
A trade-off between accuracy and fairness is almost taken as a given in the existing literature on fairness in machine learning. Yet, it is not preordained that accuracy should decrease with increased fairness. Novel to this work, we…
A Subtraction-Division game is a two player combinatorial game with three parameters: a set S, a set D, and a number n. The game starts at n, and is a race to say the number 1. Each player, on their turn, can either move the total to n-s…
In this paper we consider a Target-guarding differential game where the Defender must protect a linearly moving line segment by intercepting the Attacker who tries to reach it. In contrast to common Target-guarding problems, we assume that…
Infinite draughts, or checkers, is played just like the finite game, but on an infinite checkerboard extending without bound in all four directions. We prove that every countable ordinal arises as the game value of a position in infinite…
In "Recognizing the Maximum of a Sequence", Gilbert and Mosteller analyze a full information game where n measurements from an uniform distribution are drawn and a player (knowing n) must decide at each draw whether or not to choose that…
In computing, as in many aspects of life, changes incur cost. Many optimization problems are formulated as a one-time instance starting from scratch. However, a common case that arises is when we already have a set of prior assignments, and…
We define a variant of the two-dimensional Silver Dollar game. Two coins are placed on a chessboard of unbounded size, and two players take turns choosing one of the coins and moving it. Coins are to be moved to the left or upward…
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…
We study a condition of favoring cooperation in a Prisoner's Dilemma game on complex networks. There are two kinds of players: cooperators and defectors. Cooperators pay a benefit b to their neighbors at a cost c, whereas defectors only…
For a discrete function $f\left( x\right) $ on a discrete set, the finite difference can be either forward and backward. However, we observe that if $ f\left( x\right) $ is a sum of two functions $f\left( x\right) =f_{1}\left( x\right)…