English
Related papers

Related papers: Deconstruction of Infinite Extensive Games using c…

200 papers

We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…

Computer Science and Game Theory · Computer Science 2010-01-28 Samaresh Chatterji , Ratnik Gandhi

Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work, we proposed a framework for representing and analyzing games with possibly unaware…

Computer Science and Game Theory · Computer Science 2007-07-17 Leandro C. Rego , Joseph Y. Halpern

In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed experiments in the proof assistant Coq that are reported here.

Computer Science and Game Theory · Computer Science 2008-12-18 Pierre Lescanne

In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…

Logic · Mathematics 2015-07-01 Stephane Le Roux

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

Computer Science and Game Theory · Computer Science 2016-07-13 Stéphane Le Roux , Arno Pauly

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

Computer Science and Game Theory · Computer Science 2010-04-26 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…

Computer Science and Game Theory · Computer Science 2017-04-05 Stéphane Le Roux , Arno Pauly

We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction…

Computer Science and Game Theory · Computer Science 2016-09-15 Stéphane Le Roux , Arno Pauly

As we show by using notions of equilibrium in infinite sequential games, crashes or financial escalations are rational for economic or environmental agents, who have a vision of an infinite world. This contradicts a picture of a…

Computer Science and Game Theory · Computer Science 2012-04-27 Pierre Lescanne

Noncooperative games with uncertain payoffs have been classically studied under the expected-utility theory framework, which relies on the strong assumption that agents behave rationally. However, simple experiments on human decision makers…

Computer Science and Game Theory · Computer Science 2025-08-14 Ashok Krishnan K. S. , Hélène Le Cadre , Ana Bušić

In this paper, a gentle introduction to Game Theory is presented in the form of basic concepts and examples. Minimax and Nash's theorem are introduced as the formal definitions for optimal strategies and equilibria in zero-sum and…

Computer Science and Game Theory · Computer Science 2015-06-18 Harris V. Georgiou

This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…

Optimization and Control · Mathematics 2024-10-30 Enxian Chen , Bin Wu , Hanping Xu

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

Computer Science and Game Theory · Computer Science 2018-09-24 Yuke Li , A. Stephen Morse

Game theory studies situations in which strategic players can modify the state of a given system, due to the absence of a central authority. Solution concepts, such as Nash equilibrium, are defined to predict the outcome of such situations.…

Computer Science and Game Theory · Computer Science 2013-11-08 Diodato Ferraioli , Paul W. Goldberg , Carmine Ventre

We present infinite extensive strategy profiles with perfect information and we show that replacing finite by infinite changes the notions and the reasoning tools. The presentation uses a formalism recently developed by logicians and…

Computer Science and Game Theory · Computer Science 2015-12-23 Pierre Lescanne

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…

Quantum Physics · Physics 2007-05-23 X. F. Liu , C. P. Sun

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

Logic in Computer Science · Computer Science 2016-03-18 Stéphane Le Roux , Arno Pauly

Escalation is the fact that in a game (for instance an auction), the agents play forever. It is not necessary to consider complex examples to establish its rationality. In particular, the $0,1$-game is an extremely simple infinite game in…

Computer Science and Game Theory · Computer Science 2013-06-11 Pierre Lescanne

A fundamental problem with the Nash equilibrium concept is the existence of certain "structurally deficient" equilibria that (i) lack fundamental robustness properties, and (ii) are difficult to analyze. The notion of a "regular" Nash…

Optimization and Control · Mathematics 2019-07-31 Brian Swenson , Ryan Murray , Soummya Kar

Let $T:X\to X $ and $S:Y \to Y$ be continuous maps defined on compact sets. Let $$\varphi_i(\mu,\nu)=\int_{X \times Y} A_i(x,y) d\mu(x) d\nu(y)\;\;{for} \;\; i=1,2,$$ where $\mu$ is $T$-invariant and $\nu$ is $S$-invariant, be pay-off…

Dynamical Systems · Mathematics 2019-02-25 Rafael R. Souza