Related papers: On the combinatorial value of Hex positions
In this note we prove the uniqueness of solutions to a class of Mean Field Games systems subject to possibly degenerate individual noise. Our results hold true for arbitrary long time horizons and for general non-separable Hamiltonians that…
This paper introduces a novel criterion, persuasiveness, to select equilibria in signaling games. In response to the Stiglitz critique, persuasiveness focuses on the comparison across equilibria. An equilibrium is more persuasive than an…
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…
We study a simple example of a sequential game illustrating problems connected with making rational decisions that are universal for social sciences. The set of chooser's optimal decisions that manifest his preferences in case of a constant…
We analyze the pedestrian evacuation of a rectangular room with a single door considering a Lattice Gas scheme with the addition of behavioral aspects of the pedestrians. The movement of the individuals is based on random and rational…
The $\mathscr{P}$-position sets of some combinatorial games have special combinatorial structures. For example, the $\mathscr{P}$-position set of the hexad game, first investigated by Conway and Ryba, is the block set of the Steiner system…
Past efforts to classify impartial three-player combinatorial games (the theories of Li and Straffin) have made various restrictive assumptions about the rationality of one's opponents and the formation and behavior of coalitions. One may…
Using game theory we provide mathematical proof that if a species of asexually reproducing microbes does not possess maximum variability in competitive abilities amongst its individual organisms, then that species is vulnerable to…
In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing. This work is about the complexity behind these proofs: how hard is it to actually…
We create a new two-player game on the Sperner Triangle based on Sperner's lemma. Our game has simple rules and several desirable properties. First, the game is always certain to have a winner. Second, like many other interesting games such…
We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…
A Bayesian game is said to have nested information if the players are ordered, and each player knows the types of all players that follow her in that order. We prove that all multiplayer Bayesian games with finite actions spaces, bounded…
Self-play is a technique for machine learning in multi-agent systems where a learning algorithm learns by interacting with copies of itself. Self-play is useful for generating large quantities of data for learning, but has the drawback that…
We characterize Nash equilibrium by postulating coherent behavior across varying games. Nash equilibrium is the only solution concept that satisfies the following axioms: (i) strictly dominant actions are played with positive probability,…
Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…
Much progress has been made in misere game theory using the technique of restricted misere play, where games can be considered equivalent inside a restricted set of games without being equal in general. This paper provides a survey of…
We show, under weaker assumptions than in the previous literature, that a perpetual optimal stopping game always has a value. We also show that there exists an optimal stopping time for the seller, but not necessarily for the buyer.…
We generalize Ebert's Hat Problem for three persons and three colors. All players guess simultaneously the color of their own hat observing only the hat colors of the other players. It is also allowed for each player to pass: no color is…
We show the value of positions of the combinatorial game ``Toads and Frogs''. We present new values of starting positions. Moreover, we discuss the values of all positions with exactly one $\Box, \regT^{a}\Box\Box \regF^{a}, \regT^{a} \Box…