Related papers: Countable Fan Tightness and Selection Games in Gro…
We modify the game Fuchino, Koppelberg, and Shelah used to characterize the $\kappa$-Freese-Nation property for a given Boolean algebra $A$, replacing players I and II each with a team of $n$ players with limited information. We show that…
There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein, charges an agent for doing costly computation; the second, initiated by Neyman, does not charge for…
Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…
We consider K-Facility Location games, where n strategic agents report their locations in a metric space, and a mechanism maps them to K facilities. Our main result is an elegant characterization of deterministic strategyproof mechanisms…
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…
Graph games are fundamental in strategic reasoning of multi-agent systems and their environments. We study a new family of graph games which combine stochastic environmental uncertainties and auction-based interactions among the agents,…
Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strategies for both players and can be solved in…
We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is specified by a regular set of target configurations and a…
In general, finite concurrent two-player reachability games are only determined in a weak sense: the supremum probability to win can be approached via stochastic strategies, but cannot be realized. We introduce a class of concurrent games…
We prove that for any topological space $X$ of countable tightness, each \sigma-convex subspace $\F$ of the space $SC_p(X)$ of scatteredly continuous real-valued functions on $X$ has network weight $nw(\F)\le nw(X)$. This implies that for a…
We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model…
The game theoretic concepts of rationalizability and iterated dominance are closely related and provide characterizations of each other. Indeed, the equivalence between them implies that in a two player finite game, the remaining set of…
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections…
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…
We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the size of the memory and the bound achieved on the counters,…
Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may…
In this paper we study how to play (stochastic) games optimally using little space. We focus on repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games. The prototypical example of these games is…
A topological gyrogroup is a gyrogroup endowed with a topology such that the binary operation is jointly continuous and the inverse mapping is also continuous. In this paper, it is proved that if $G$ is a sequential topological gyrogroup…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
We prove that the locally convex space $C_{p}(X)$ of continuous real-valued functions on a Tychonoff space $X$ equipped with the topology of pointwise convergence is distinguished if and only if $X$ is a $\Delta$-space in the sense of \cite…