Related papers: Absolute Combinatorial Game Theory
Congestion games constitute an important class of non-cooperative games which was introduced by Rosenthal in 1973. In recent years, several extensions of these games were proposed to incorporate aspects that are not captured by the standard…
We are interested in the convergence of the value of n-stage games as n goes to infinity and the existence of the uniform value in stochastic games with a general set of states and finite sets of actions where the transition is commutative.…
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chapter of this manuscript is devoted to highlighting the…
This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a…
We consider a class of fully stochastic and fully distributed algorithms, that we prove to learn equilibria in games. Indeed, we consider a family of stochastic distributed dynamics that we prove to converge weakly (in the sense of weak…
The "War of Attrition" is a classical game theoretic model that was first introduced to mathematically describe certain non-violent animal behavior. The original setup considers two participating players in a one-shot game competing for a…
After a brief introduction to one of the most typical problems in Mean Field Games, the congestion case (where agents pay a cost depending on the density of the regions they visit), and to its variational structure, we consider the question…
In this work, we establish near-linear and strong convergence for a natural first-order iterative algorithm that simulates Von Neumann's Alternating Projections method in zero-sum games. First, we provide a precise analysis of Optimistic…
We study generalized games with full row rank equality constraints and we provide a strikingly simple proof of strong monotonicity of the associated KKT operator. This allows us to show linear convergence to a variational equilibrium of the…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
We propose a new class of games, called Multi-Games (MG), in which a given number of players play a fixed number of basic games simultaneously. In each round of the MG, each player will have a specific set of weights, one for each basic…
We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…
Two-player graph games have found numerous applications, most notably in the synthesis of reactive systems from temporal specifications, but also in verification. The relevance of infinite-state systems in these areas has lead to…
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a…
We formulate the novel class of contextual games, a type of repeated games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game…
J. Conway defined useful operations on the Class of combinatorial games and also introduced a notion of equivalence between games. Conway showed that, under his equivalence, games form a Group. However, Conway product is not well defined on…
Game-theoretic upper expectations are joint (global) probability models that mathematically describe the behaviour of uncertain processes in terms of supermartingales; capital processes corresponding to available betting strategies.…
A graph $G = (V,E)$ is said to be saturated with respect to a monotone increasing graph property ${\mathcal P}$, if $G \notin {\mathcal P}$ but $G \cup \{e\} \in {\mathcal P}$ for every $e \in \binom{V}{2} \setminus E$. The saturation game…
We provide a unifying, black-box tool for establishing existence of approximate equilibria in weighted congestion games and, at the same time, bounding their Price of Stability. Our framework can handle resources with general…
In settings where full incentive-compatibility is not available, such as core-constraint combinatorial auctions and budget-balanced combinatorial exchanges, we may wish to design mechanisms that are as incentive-compatible as possible. This…