Related papers: Mis\`ere Games and Mis\`ere Quotients

Ecologists and economists try to explain collective behavior in terms of competitive systems of selfish individuals with the ability to learn from the past. Statistical physicists have been investigating models which might contribute to the…

This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules. We introduce and investigate taking-and-merging games, that is, where…

We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, comply-constrain games, and card games that have been studied…

This article continues study of the prequential framework for evaluating a probability forecaster. Testing the hypothesis that the sequence of forecasts issued by the forecaster is in agreement with the observed outcomes can be done using…

These are lecture notes of the course in infinity categories given in the fall 2016 at Weizmann Institute.

The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to classical operations cannot do so, a phenomenon dubbed…

This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…

These are lecture notes for a mini-course given at the St. Petersburg School in Probability and Statistical Physics in June 2012. Topics include integrable models of random growth, determinantal point processes, Schur processes and Markov…

In this article we consider finite Mean Field Games (MFGs), i.e. with finite time and finite states. We adopt the framework introduced in Gomes Mohr and Souza in 2010, and study two seemly unexplored subjects. In the first one, we analyze…

We study Dynkin games governed by a nonlinear $\mathbb E^f$-expectation on a finite interval $[0,T]$, with payoff c\`adl\`ag processes $L,U$ of class (D) which are not imposed to satisfy (weak) Mokobodzki's condition - the existence of a…

The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became…

We present a version of the Banach-Mazur game, where open sets are replaced by elements of a fixed partially ordered set. We show how to apply it in the theory of Fraisse limits and beyond, obtaining simple proofs of universality of certain…

By applying a Mawhin's continuation theorem of coincidence degree theory, we establish sufficient conditions for the existence of a periodic solution for a class of impulsive neutral differential equations. The procedure adopted in this…

The present notes provide an extended version of a small lecture course given at the Humboldt Universit\"at zu Berlin in the Winter Term 2022/23 (of 36 hours). The material starting in Section 5.4 was added afterwards. The aim of these…

These notes are based on three lectures given by the first author as part of an introductory workshop at MSRI for the program in Commutative Algebra, 2012-13. The notes follow the talks, but there are extra comments and explanations, as…

We close the gap in the proof (published by Chen and Lin) of formulas for the minimum number of questions required in the expected case for Mastermind and its variant called AB game, where both games are played with two pegs and $n$ colors.…

Nearly a decade ago, Azrieli and Shmaya introduced the class of $\lambda$-Lipschitz games in which every player's payoff function is $\lambda$-Lipschitz with respect to the actions of the other players. They showed that such games admit…

This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that…

We study 2-player impartial games of the form take-away which produce P-positions (second player winning positions) corresponding to complementary Beatty sequences, given by the continued fractions (1;k,1,k,1,...) and (k+1;k,1,k,1,...). Our…

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…