Results 1 to 10 of about 2,721,098 (25)
Well-Founded Extensive Games with Perfect Information [PDF]
EPTCS 335, 2021, pp. 7-21, 2021 We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations for two classes of these games in which subgame perfect equilibria exist: two-player zero-sum games with ...
arxiv +1 more source
The Game of Pure Strategy is solved! [PDF]
Games 3 (2012) 150--156, 2012 We solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behavior in the results of our computations, that seems to encourage odd or maximal bids.
arxiv +1 more source
Blackwell-Optimal Strategies in Priority Mean-Payoff Games [PDF]
EPTCS 25, 2010, pp. 7-21, 2010 We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are optimal for priority mean-payoff games establishing a ...
arxiv +1 more source
On Nash-solvability of finite $n$-person shortest path games; bi-shortest path conjecture [PDF]
arXiv, 2021 We formulate a conjecture from graph theory that is equivalent to Nash-solvability of the finite two-person shortest path games with positive local costs. For the three-person games such conjecture fails.
arxiv
O'Neill's Theorem for Games [PDF]
arXiv, 2023 We present an analog of O'Neill's Theorem (Theorem 5.2 in [17]) for finite games, which reveals some of the structure of equilibria under payoff perturbations in finite games.
arxiv
Infinite horizon for symetric strategy population game [PDF]
arXiv, 2022 To predict the behavior of a population game when time becomes very long, the process that characterizes the evolution of our game dynamics must be reversible. Known games satisfying this are 2 strategy games as well as potential games with an exponential protocol.
arxiv
Matrix Games, Linear Programming, and Linear Approximation [PDF]
arXiv, 2006 The following four classes of computational problems are equivalent: solving matrix games, solving linear programs, best $l^{\infty}$ linear approximation, best $l^1$ linear approximation.
arxiv
Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games [PDF]
arXiv, 2009 An abstraction of normal form games is proposed, called Feasibility/Desirability Games (or FD Games in short). FD Games can be seen from three points of view: as a new presentation of games in which Nash equilibria can be found, as choice models in microeconomics or as a model of evolution in games.
arxiv
Information Security Games: A Survey [PDF]
arXiv, 2021 We introduce some preliminaries about game theory and information security. Then surveying a subset of the literature, we identify opportunities for future research.
arxiv
On the Complexity of Deciding Degeneracy in Games [PDF]
arXiv, 2009 We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a bimatrix game is nondegenerate.
arxiv