English
Related papers

Related papers: The Category of Node-and-Choice Extensive-Form Gam…

200 papers

This paper specifies an extensive form as a 5-ary relation (that is, as a set of quintuples) which satisfies eight abstract axioms. Each quintuple is understood to list a player, a situation (that is, a name for an information set), a…

Theoretical Economics · Economics 2025-09-23 Peter A. Streufert

In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbitrary game into three components, which we refer to as the…

Computer Science and Game Theory · Computer Science 2015-03-17 Ozan Candogan , Ishai Menache , Asuman Ozdaglar , Pablo A. Parrilo

We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every…

Computer Science and Game Theory · Computer Science 2020-05-20 Sung-Ha Hwang , Luc Rey-Bellet

The recent theory of sequential games and selection functions by Mar- tin Escardo and Paulo Oliva is extended to games in which players move simultaneously. The Nash existence theorem for mixed-strategy equilibria of finite games is…

Logic in Computer Science · Computer Science 2015-06-12 Julian Hedges

A valuation for a player in a game in extensive form is an assignment of numeric values to the players moves. The valuation reflects the desirability moves. We assume a myopic player, who chooses a move with the highest valuation.…

Machine Learning · Computer Science 2007-05-23 Philippe Jehiel , Dov Samet

We fully characterize the core of a broad class of nonlinear games by identifying a suitable relaxation for inherent nonlinearity, directly generalizing the linear frameworks in the literature. This characterization significantly expands…

Optimization and Control · Mathematics 2026-01-21 Donglei Du , Qizhi Fang , Bin Liu , Tianhang Lu , Chenchen Wu

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

We argue that the extensive-form game (EFG) model isn't powerful enough to express all important aspects of imperfect information games, such as those related to decomposition and online game solving. We present a principled attempt to fix…

Computer Science and Game Theory · Computer Science 2019-06-17 Vojtěch Kovařík , Viliam Lisý

In this paper, we investigate under which conditions normal-form games are (guaranteed to be) strategically equivalent. First, we show for N-player games (N >= 3) that (A) it is NP-hard to decide whether a given strategy is a best response…

Computer Science and Game Theory · Computer Science 2024-06-25 Emanuel Tewolde , Vincent Conitzer

This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…

Methodology · Statistics 2018-03-20 Nianqing Liu , Quang Vuong , Haiqing Xu

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 introduce open games as a compositional foundation of economic game theory. A compositional approach potentially allows methods of game theory and theoretical computer science to be applied to large-scale economic models for which…

Computer Science and Game Theory · Computer Science 2018-02-16 Neil Ghani , Jules Hedges , Viktor Winschel , Philipp Zahn

There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…

Combinatorics · Mathematics 2024-02-09 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

Equilibrium solution concepts of normal-form games, such as Nash equilibria, correlated equilibria, and coarse correlated equilibria, describe the joint strategy profiles from which no player has incentive to unilaterally deviate. They are…

Computer Science and Game Theory · Computer Science 2023-04-21 Luke Marris , Ian Gemp , Georgios Piliouras

We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the…

Computer Science and Game Theory · Computer Science 2022-04-20 Krzysztof R. Apt , Sunil Simon

Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium.…

Computer Science and Game Theory · Computer Science 2007-12-11 Stéphane Le Roux

We extend the study of the iterated elimination of strictly dominated strategies (IESDS) from Nash strategic games to a class of qualitative games. Also in this case, the IESDS process leads us to a kind of 'rationalizable' result. We…

Computer Science and Game Theory · Computer Science 2013-03-29 Monica Patriche

An axiomatic characterization of Nash equilibrium is provided for games in normal form. The Nash equilibrium correspondence is shown to be fully characterized by four simple and intuitive axioms, two of which are inspired by contraction and…

Theoretical Economics · Economics 2025-12-04 Michele Crescenzi

We introduce a new unified framework for modelling both decision problems and finite games based on quantifiers and selection functions. We show that the canonical utility maximisation is one special case of a quantifier and that our more…

Logic in Computer Science · Computer Science 2014-09-29 Jules Hedges , Paulo Oliva , Evguenia Winschel , Viktor Winschel , Philipp Zahn