Related papers: Mis\`ere Games and Mis\`ere Quotients
These are (not updated) notes from the lectures I gave at the NATO ASI ``Symmetric Functions 2001'' at the Isaac Newton Institute in Cambridge (June 25 -- July 6, 2001). Their goal is an informal introduction to asymptotic combinatorics…
Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantum pseudo-telepathy games are common…
A new class of multi-player competitive stochastic games in discrete-time with an affine specification of the redistribution of payoffs at exercise is proposed and examined. Our games cover as a very special case the classic two-person…
The objective is the interplay between stochastic processes and partial differential equations. To be more precise, we focus on the connection between the nonlinear p-Laplace equation, and the stochastic game called tug-of-war with noise.…
We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…
These notes were written for a set of three lectures given in a school at the Max Planck Institute for the Physics of Complex Systems in October/2017 before the workshop "Critical Stability of Quantum Few-Body Systems". These lectures are…
Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum…
We provide game-theoretic proofs of some well-known existence theorems of Friedberg numberings for the class of all partial computable functions, including (1) the existence of two incomparable Friedberg numberings; (2) the existence of a…
This document collects the lecture notes from my mini-course "Complexity Theory, Game Theory, and Economics," taught at the Bellairs Research Institute of McGill University, Holetown, Barbados, February 19--23, 2017, as the 29th McGill…
Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic, no microscopic quantum agent is supposed. The reason for…
The goal of these notes is to provide an informal introduction to Gromov-Witten theory with an emphasis on its role in counting curves in surfaces. These notes are based on a talk given at the Fields Institute during a week-long conference…
This is the lecture note of my invited lecture given at the International Conference on Number Theory at Harish-Chandra Research Institute in Allahabad (quite near the River Ganges), India on December 5, 2006. I gave an invited lecture on…
Mertens, Neyman and Rosenberg [MOR, 2009] used the Mertens and Neyman theorem [IJGT, 1981] to prove the existence of uniform value for absorbing games with finite state space and compact action sets. We provide an analogous proof for…
We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objective. The specific fairness we consider is called 'strong…
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper presents the history, basic ideas and recent development in quantum game theory. In this…
We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's…
A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…
Estimating discrete games of complete information is often computationally difficult due to partial identification and the absence of closed-form moment characterizations. This paper proposes computationally tractable approaches to…
Notes from lectures given at the Autumn School on Algebraic and Arithmetic Geometry at the Johannes Gutenberg-Universit\"at Mainz in October 2017.
This is an extended and corrected version of lecture notes originally written for a one semester course at Leibniz University Hannover. The main aim of the notes is to give an introduction to the mathematical methods used in describing…