Results 11 to 20 of about 2,721,098 (25)

Exact Algorithms for Solving Stochastic Games [PDF]

arXiv, 2012
Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.
arxiv  

Distributed Games and Strategies [PDF]

arXiv, 2016
A summary of work on distributed games and strategies done within the first three years of the ERC project ECSYM is presented.
arxiv  

Rank-1 Games With Exponentially Many Nash Equilibria [PDF]

arXiv, 2012
The rank of a bimatrix game (A,B) is the rank of the matrix A+B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).
arxiv  

On Dynamical Cournot Game on a Graph [PDF]

arXiv, 2012
Cournot dynamical game is studied on a graph. The stability of the system is studied. Prisoner's dilemma game is used to model natural gas transmission.
arxiv  

The relation between eigenvalue/eigenvector and matrix game [PDF]

arXiv, 2020
Matrix game, which is also known as two person zero sum game, is a famous model in game theory. There are some well established theories about it, such as von Neumann minimax theorem. However, almost no literature have reported the relationship between eigenvalue/eigenvector and properties of matrix game.
arxiv  

A New Algorithm for the Subtraction Games [PDF]

arXiv, 2012
Subtraction games is a class of combinatorial games. It was solved since the Sprague-Grundy Theory was put forward. This paper described a new algorithm for subtraction games. The new algorithm can find win or lost positions in subtraction games. In addition, it is much simpler than Sprague-Grundy Theory in one pile of the games.
arxiv  

On the computational complexity of solving stochastic mean-payoff games [PDF]

arXiv, 2008
We consider some well-known families of two-player, zero-sum, perfect information games that can be viewed as special cases of Shapley's stochastic games. We show that the following tasks are polynomial time equivalent: - Solving simple stochastic games. - Solving stochastic mean-payoff games with rewards and probabilities given in unary. - Solving
arxiv  

Communication complexity of Nash equilibrium in potential games [PDF]

arXiv, 2020
We prove communication complexity lower bounds for (possibly mixed) Nash equilibrium in potential games. In particular, we show that finding a Nash equilibrium requires $poly(N)$ communication in two-player $N \times N$ potential games, and $2^{poly(n)}$ communication in $n$-player two-action games.
arxiv  

An NP-hard generalization of Nim [PDF]

arXiv
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
arxiv  

Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time [PDF]

arXiv, 2018
We provide an algorithm for computing the nucleolus for an instance of a weighted voting game in pseudo-polynomial time. This resolves an open question posed by Elkind. et.al. 2007.
arxiv