English
Related papers

Related papers: Well-Founded Extensive Games with Perfect Informat…

200 papers

By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…

Computer Science and Game Theory · Computer Science 2017-12-11 Yaqi Hao , Daizhan Cheng

In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…

Computer Science and Game Theory · Computer Science 2015-04-29 Xinyun Liu , Jiandong Zhu

We tackle a fundamental problem in empirical game-theoretic analysis (EGTA), that of learning equilibria of simulation-based games. Such games cannot be described in analytical form; instead, a black-box simulator can be queried to obtain…

Computer Science and Game Theory · Computer Science 2019-06-03 Enrique Areyan Viqueira , Cyrus Cousins , Eli Upfal , Amy Greenwald

Two-team zero-sum games are one of the most important paradigms in game theory. In this paper, we focus on finding an unexploitable equilibrium in large team games. An unexploitable equilibrium is a worst-case policy, where members in the…

Computer Science and Game Theory · Computer Science 2024-03-04 Naming Liu , Mingzhi Wang , Youzhi Zhang , Yaodong Yang , Bo An , Ying Wen

We consider a class of two-player dynamic stochastic nonzero-sum games where the state transition and observation equations are linear, and the primitive random variables are Gaussian. Each controller acquires possibly different dynamic…

Systems and Control · Computer Science 2014-01-21 Abhishek Gupta , Ashutosh Nayyar , Cedric Langbort , Tamer Basar

We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytically tractable than the standard definition in terms of…

Computer Science and Game Theory · Computer Science 2011-06-06 Noah D. Stein , Pablo A. Parrilo , Asuman Ozdaglar

We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…

Optimization and Control · Mathematics 2013-03-29 Monica Patriche

Limited lookahead has been studied for decades in perfect-information games. We initiate a new direction via two simultaneous deviation points: generalization to imperfect-information games and a game-theoretic approach. We study how one…

Computer Science and Game Theory · Computer Science 2020-03-20 Christian Kroer , Tuomas Sandholm

There has been a recent surge of interest in the role of information in strategic interactions. Much of this work seeks to understand how the realized equilibrium of a game is influenced by uncertainty in the environment and the information…

Computer Science and Game Theory · Computer Science 2014-07-22 Shaddin Dughmi

This paper introduces alignment games, a new class of zero-sum games modeling strategic interventions where effectiveness depends on alignment with an underlying hidden state. Motivated by operational problems in medical diagnostics,…

Optimization and Control · Mathematics 2025-09-08 Pedro Cesar Lopes Gerum , Thomas Lidbetter

We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore…

Computer Science and Game Theory · Computer Science 2013-03-05 Nicholas Asher , Soumya Paul

We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with perfect information can be solved in PTIME. Restricting the…

Computer Science and Game Theory · Computer Science 2017-03-03 Bernd Puchala , Roman Rabinovich

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a…

Computer Science and Game Theory · Computer Science 2007-05-23 Constantinos Daskalakis

Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves, and are then informed of each other's moves. Payoff is determined by a Borel measurable function $f$ on the set of possible…

Logic · Mathematics 2009-09-25 Marco R. Vervoort

In this paper, we investigate a class of nonzero-sum dynamic stochastic games, where players have linear dynamics and quadratic cost functions. The players are coupled in both dynamics and cost through a linear regression (weighted average)…

Optimization and Control · Mathematics 2020-10-20 Jalal Arabneydi , Amir G. Aghdam , Roland P. Malhamé

This paper is concerned with a new type of differential game problems of forwardbackward stochastic systems. There are three distinguishing features: Firstly, our game systems are forward-backward doubly stochastic differential equations,…

Optimization and Control · Mathematics 2015-10-09 Eddie C. M. Hui , Hua Xiao

We study multiplayer turn-based timed games with reachability objectives. In particular, we are interested in the notion of subgame perfect equilibrium (SPE). We prove that deciding the constrained existence of an SPE in this setting is…

Computer Science and Game Theory · Computer Science 2020-06-19 Thomas Brihaye , Aline Goeminne

Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…

Computer Science and Game Theory · Computer Science 2023-04-18 Fivos Kalogiannis , Ioannis Panageas , Emmanouil-Vasileios Vlatakis-Gkaragkounis

We study a general class of dynamic games with asymmetric information where agents' beliefs are strategy dependent, i.e. signaling occurs. We show that the notion of sufficient information, introduced in the companion paper team, can be…

Multiagent Systems · Computer Science 2018-12-05 Hamidreza Tavafoghi , Yi Ouyang , Demosthenis Teneketzis

In this paper we investigate the Follow the Regularized Leader dynamics in sequential imperfect information games (IIG). We generalize existing results of Poincar\'e recurrence from normal-form games to zero-sum two-player imperfect…

‹ Prev 1 8 9 10 Next ›