English
Related papers

Related papers: Dynkin games with incomplete and asymmetric inform…

200 papers

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 consider multi-player stopping games in continuous time. Unlike Dynkin games, in our games the payoff of each player is revealed after all the players stop. Moreover, each player can adjust her own stopping strategy by observing other…

Optimization and Control · Mathematics 2015-09-15 Zhou Zhou

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

Optimization and Control · Mathematics 2014-12-11 Jérôme Renault , Bruno Ziliotto

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

A zero-sum two-person Perfect Information Semi-Markov game (PISMG) under limiting ratio average payoff has a value and both the maximiser and the minimiser have optimal pure semi-stationary strategies. We arrive at the result by first…

Computer Science and Game Theory · Computer Science 2023-02-15 S. Sinha , K. G. Bakshi

The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the…

Computer Science and Game Theory · Computer Science 2021-04-22 János Flesch , Arkadi Predtetchinski , Ville Suomala

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…

Computer Science and Game Theory · Computer Science 2012-11-20 Ivan Guo

In this paper we study the N-player nonzero-sum Dynkin game ($N\geq 3$) in continuous time, which is a non-cooperative game where the strategies are stopping times. We show that the game has a Nash equilibrium point for general payoff…

Computer Science and Game Theory · Computer Science 2011-10-27 Hamadene Said , Hassani Mohammed

In this paper, we extend the Descent framework, which enables learning and planning in the context of two-player games with perfect information, to the framework of stochastic games. We propose two ways of doing this, the first way…

Artificial Intelligence · Computer Science 2023-02-10 Quentin Cohen-Solal , Tristan Cazenave

In this paper, we revisit the two-player continuous-time infinite-horizon linear quadratic differential game problem, where one of the players can sample the state of the system only intermittently due to a sensing constraint while the…

Optimization and Control · Mathematics 2024-06-11 Shubham Aggarwal , Tamer Başar , Dipankar Maity

We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model…

Logic in Computer Science · Computer Science 2010-06-09 Krishnendu Chatterjee , Rupak Majumdar

We study optimal information provision in transportation networks when users are strategic and the network state is uncertain. An omniscient planner observes the network state and discloses information to the users with the goal of…

Computer Science and Game Theory · Computer Science 2023-12-01 Leonardo Cianfanelli , Alexia Ambrogio , Giacomo Como

A game-theoretic framework for time-inconsistent stopping problems where the time-inconsistency is due to the consideration of a non-linear function of an expected reward is developed. A class of mixed strategy stopping times that allows…

Optimization and Control · Mathematics 2020-01-23 Sören Christensen , Kristoffer Lindensjö

We describe and develop a close relationship between two problems that have customarily been regarded as distinct: that of maximizing entropy, and that of minimizing worst-case expected loss. Using a formulation grounded in the equilibrium…

Statistics Theory · Mathematics 2007-06-13 Peter D. Grunwald , A. Philip Dawid

We consider an optimal stopping problem with n correlated offers where the goal is to design a (randomized) stopping strategy that maximizes the expected value of the offer in the sequence at which we stop. Instead of assuming to know the…

Optimization and Control · Mathematics 2025-07-08 Pieter Kleer , Daan Noordenbos

We study the role of costly information in non-cooperative two-player games when an extrinsic third party information broker is introduced asymmetrically, allowing one player to obtain information about the other player's action. This…

Computer Science and Game Theory · Computer Science 2020-02-20 Matthew J. Young , Andrew Belmonte

We study linear-quadratic games of incomplete information with Gaussian uncertainty, where each player's payoff depends on a privately observed type and a common state. The designer observes the state, elicits types, and sells action…

Computer Science and Game Theory · Computer Science 2025-11-04 Alessandro Bonatti , Munther A. Dahleh , Thibaut Horel

Differential games with asymmetric information were introduced by Cardaliaguet (2007). As in repeated games with lack of information on both sides (Aumann and Maschler (1995)), each player receives a private signal (his type) before the…

Optimization and Control · Mathematics 2014-03-31 Miquel Oliu-Barton

We study a Stackelberg variant of the classical discrete-time Dynkin game, in which Player 1 (the leader) commits to a stopping strategy first and Player 2 (the follower) responds optimally. This leader-follower structure induces an optimal…

Optimization and Control · Mathematics 2026-05-26 Jingjie Zhang , Zhou Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›