中文
相关论文

相关论文: Optimal strategies in repeated games with incomple…

200 篇论文

For zero-sum two-player continuous-time games with integral payoff and incomplete information on one side, one shows that the optimal strategy of the informed player can be computed through an auxiliary optimization problem over some…

概率论 · 数学 2008-10-02 Pierre Cardaliaguet , Catherine Rainer

We study a class of two-player repeated games with incomplete information and informational externalities. In these games, two states are chosen at the outset, and players get private information on the pair, before engaging in repeated…

概率论 · 数学 2010-07-27 Dinah Rosenberg , Eilon Solan , Nicolas Vieille

This work considers two-player zero-sum semi-Markov games with incomplete information on one side and perfect observation. At the beginning, the system selects a game type according to a given probability distribution and informs to Player…

最优化与控制 · 数学 2021-07-16 Fang Chen , Xianping Guo , Zhong-Wei Liao

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…

最优化与控制 · 数学 2012-07-11 Christine Grün

We describe an algorithm for computing best response strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents' types and actions, conditional on linear comparisons of…

计算机科学与博弈论 · 计算机科学 2012-07-19 Daniel Reeves , Michael P. Wellman

In this article, we focus on search algorithms for two-player perfect information games, whose objective is to determine the best possible strategy, and ideally a winning strategy. Unfortunately, some search algorithms for games in the…

人工智能 · 计算机科学 2026-03-26 Quentin Cohen-Solal

We study the conditions under which the iterated elimination of strictly dominated strategies is order independent and we identify a class of discontinuous games for which order does not matter. In this way, we answer the open problem…

最优化与控制 · 数学 2013-03-29 Monica Patriche

We study the value and the optimal strategies for a two-player zero-sum optimal stopping game with incomplete and asymmetric information. In our Bayesian set-up, the drift of the underlying diffusion process is unknown to one player…

概率论 · 数学 2020-07-15 Tiziano De Angelis , Erik Ekström , Kristoffer Glover

In classical game theory, optimal strategies are determined for games with complete information; this requires knowledge of the opponent's goals. We analyze games when a player is mistaken about their opponents goals. For definitiveness, we…

计算机科学与博弈论 · 计算机科学 2023-07-21 Dan Zwillinger , Paul San Clemente

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…

最优化与控制 · 数学 2019-03-19 Galit Ashkenazi-Golan , Catherine Rainer , Eilon Solan

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…

最优化与控制 · 数学 2014-03-31 Miquel Oliu-Barton

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…

计算机科学与博弈论 · 计算机科学 2025-11-04 Alessandro Bonatti , Munther A. Dahleh , Thibaut Horel

It is well-known that for infinitely repeated games, there are computable strategies that have best responses, but no computable best responses. These results were originally proved for either specific games (e.g., Prisoner's dilemma), or…

计算机科学与博弈论 · 计算机科学 2020-06-11 Jakub Dargaj , Jakob Grue Simonsen

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…

计算机科学与博弈论 · 计算机科学 2016-07-19 Dietmar Berwanger , Anup Basil Mathew , Marie van den Bogaard

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…

理论经济学 · 经济学 2023-03-10 Lucas Pahl

We consider two-player games with imperfect information and the synthesis of a randomized strategy for one player that ensures the objective is satisfied almost-surely (i.e., with probability 1), regardless of the strategy of the other…

计算机科学与博弈论 · 计算机科学 2024-07-30 Laurent Doyen , Thomas Soullard

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

计算机科学与博弈论 · 计算机科学 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

Desensitization addresses safe optimal planning under parametric uncertainties by providing sensitivity function-based risk estimates. This paper expands upon the existing work on desensitization in optimal control to address safe planning…

系统与控制 · 电气工程与系统科学 2024-02-08 Vinodhini Comandur , Tulasi Ram Vechalapu , Venkata Ramana Makkapati , Panagiotis Tsiotras , Seth Hutchinson

We consider a two-player zero-sum stochastic differential game in which one of the players has a private information on the game. Both players observe each other, so that the non-informed player can try to guess his missing information. Our…

概率论 · 数学 2011-06-15 Christine Grün

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…

理论经济学 · 经济学 2025-01-28 Joep van Sloun
‹ 上一页 1 2 3 10 下一页 ›