Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:1909.01445

Help | Advanced Search

Electrical Engineering and Systems Science > Systems and Control

arXiv:1909.01445 (eess)
[Submitted on 3 Sep 2019 (v1) , last revised 24 Dec 2019 (this version, v2)]

Title: Zero-sum Stochastic Games with Asymmetric Information

Title: 零和随机博弈中的信息不对称

Authors:Dhruva Kartik, Ashutosh Nayyar
Abstract: A general model for zero-sum stochastic games with asymmetric information is considered. In this model, each player's information at each time can be divided into a common information part and a private information part. Under certain conditions on the evolution of the common and private information, a dynamic programming characterization of the value of the game (if it exists) is presented. If the value of the zero-sum game does not exist, then the dynamic program provides bounds on the upper and lower values of the game. This dynamic program is then used for a class of zero-sum stochastic games with complete information on one side and partial information on the other, that is, games where one player has complete information about state, actions and observation history while the other player may only have partial information about the state and action history. For such games, it is shown that the value exists and can be characterized using the dynamic program. It is further shown that for this class of games, the dynamic program can be used to compute an equilibrium strategy for the more informed player in which the player selects its action using its private information and the common information belief.
Abstract: 考虑了一个具有不对称信息的零和随机博弈的一般模型。在这个模型中,每个玩家在每个时间点的信息可以分为公共信息部分和私人信息部分。在对公共信息和私人信息演变的某些条件下,给出了博弈值(如果存在的话)的动态规划表征。如果零和博弈的值不存在,则动态规划提供了博弈上值和下值的界。然后,该动态规划被用于一类零和随机博弈,其中一方具有完全信息,另一方具有部分信息,即一方玩家对状态、动作和观测历史具有完全信息,而另一方玩家可能仅对状态和动作历史具有部分信息。对于这类博弈,证明了值的存在性,并可以使用动态规划进行表征。进一步证明,对于此类博弈,动态规划可用于计算更知情玩家的均衡策略,其中该玩家使用其私人信息和公共信息信念来选择其动作。
Comments: Accepted for presentation at the 58th Conference on Decision and Control (CDC), 2019 Submitted to Dynamic Games and Applications
Subjects: Systems and Control (eess.SY) ; Computer Science and Game Theory (cs.GT)
Cite as: arXiv:1909.01445 [eess.SY]
  (or arXiv:1909.01445v2 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.1909.01445
arXiv-issued DOI via DataCite

Submission history

From: Dhruva Kartik [view email]
[v1] Tue, 3 Sep 2019 20:40:14 UTC (513 KB)
[v2] Tue, 24 Dec 2019 18:21:08 UTC (92 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
eess.SY
< prev   |   next >
new | recent | 2019-09
Change to browse by:
cs
cs.GT
cs.SY
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号