English
Related papers

Related papers: Highly lopsided information and the Borel hierarch…

200 papers

Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a total ordering among players, such that each player has access…

Computer Science and Game Theory · Computer Science 2016-07-19 Dietmar Berwanger , Anup Basil Mathew , Marie van den Bogaard

Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…

Computer Science and Game Theory · Computer Science 2015-07-29 Dietmar Berwanger , Anup Basil Mathew

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

In statistical decision theory involving a single decision-maker, an information structure is said to be better than another one if for any cost function involving a hidden state variable and an action variable which is restricted to be…

Optimization and Control · Mathematics 2021-01-07 Ian Hogeboom-Burr , Serdar Yüksel

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

We study in depth the class of games with opacity condition, which are two-player games with imperfect information in which one of the players only has imperfect information, and where the winning condition relies on the information he has…

Computer Science and Game Theory · Computer Science 2011-06-08 Bastien Maubert , Sophie Pinchinat , Laura Bozzelli

We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, B\"uchi and co-B\"uchi objectives, and investigate the existence of…

Formal Languages and Automata Theory · Computer Science 2018-03-28 Arnaud Carayol , Christof Löding , Olivier Serre

We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor…

Formal Languages and Automata Theory · Computer Science 2011-08-31 Vincent Gripon , Olivier Serre

This paper examines games with strategic complements or substitutes and incomplete information, where players are uncertain about the opponents' parameters. We assume that the players' beliefs about the opponent's parameters are selected…

Theoretical Economics · Economics 2025-01-28 Joep van Sloun

We study multi-player games with perfect information and general payoff function, where the set of stages is the set of non-positive integers $\{\ldots,-2,-1,0\}$. We define two related equilibrium concepts: one considering only deviations…

Optimization and Control · Mathematics 2025-12-02 Galit Ashkenazi-Golan , János Flesch , Eilon Solan

This paper considers an infinitely repeated three-player Bayesian game with lack of information on two sides, in which an informed player plays two zero-sum games simultaneously at each stage against two uninformed players. This is a…

Theoretical Economics · Economics 2023-03-10 Lucas Pahl

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…

Computer Science and Game Theory · Computer Science 2021-06-23 Krzysztof R. Apt , Sunil Simon

Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically…

Computer Science and Game Theory · Computer Science 2014-05-08 Julie De Pril , János Flesch , Jeroen Kuipers , Gijs Schoenmakers , Koos Vrieze

We study the optimal use of information in Markov games with incomplete information on one side and two states. We provide a finite-stage algorithm for calculating the limit value as the gap between stages goes to 0, and an optimal strategy…

Optimization and Control · Mathematics 2019-03-19 Galit Ashkenazi-Golan , Catherine Rainer , Eilon Solan

In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under…

Logic in Computer Science · Computer Science 2013-03-05 Rayna Dimitrova , Bernd Finkbeiner

n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…

Logic · Mathematics 2011-07-06 Eran Shmaya

We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players' knowledge. One original aspect of our approach is that we do not force strategies to be uniform,…

Logic in Computer Science · Computer Science 2019-08-08 Sophia Knight , Bastien Maubert

Let us consider two companies A and B. Both of them are interested in buying a set of some goods. The company A is a big corporation and it knows the actual value of the good on the market and is able to observe the previous values of them.…

Optimization and Control · Mathematics 2023-06-09 Marek Skarupski , Krzysztof Szajowski

Information asymmetry in games enables players with the information advantage to manipulate others' beliefs by strategically revealing information to other players. This work considers a double-sided information asymmetry in a Bayesian…

Computer Science and Game Theory · Computer Science 2023-08-29 Tao Li , Quanyan Zhu

In this paper we investigate a game of optimal stopping with incomplete information. There are two players of which only one is informed about the precise structure of the game. Observing the informed player the uninformed player is given…

Optimization and Control · Mathematics 2012-07-11 Christine Grün
‹ Prev 1 2 3 10 Next ›