[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computer Science and Game Theory

arXiv:1410.4154 (cs)
[Submitted on 15 Oct 2014 (v1), last revised 24 Sep 2015 (this version, v3)]

Title:Making the Best of Limited Memory in Multi-Player Discounted Sum Games

Authors:Anshul Gupta (University of Liverpool), Sven Schewe (University of Liverpool), Dominik Wojtczak (University of Liverpool)
View PDF
Abstract:In this paper, we establish the existence of optimal bounded memory strategy profiles in multi-player discounted sum games. We introduce a non-deterministic approach to compute optimal strategy profiles with bounded memory. Our approach can be used to obtain optimal rewards in a setting where a powerful player selects the strategies of all players for Nash and leader equilibria, where in leader equilibria the Nash condition is waived for the strategy of this powerful player. The resulting strategy profiles are optimal for this player among all strategy profiles that respect the given memory bound, and the related decision problem is NP-complete. We also provide simple examples, which show that having more memory will improve the optimal strategy profile, and that sufficient memory to obtain optimal strategy profiles cannot be inferred from the structure of the game.
Comments: In Proceedings GandALF 2015, arXiv:1509.06858
Subjects: Computer Science and Game Theory (cs.GT)
Cite as: arXiv:1410.4154 [cs.GT]
  (or arXiv:1410.4154v3 [cs.GT] for this version)
  https://doi.org/10.48550/arXiv.1410.4154
Journal reference: EPTCS 193, 2015, pp. 16-30
Related DOI: https://doi.org/10.4204/EPTCS.193.2

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Wed, 15 Oct 2014 18:20:42 UTC (21 KB)
[v2] Thu, 30 Jul 2015 15:04:37 UTC (21 KB)
[v3] Thu, 24 Sep 2015 01:53:44 UTC (24 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.GT
< prev   |   next >
new | recent | 2014-10
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Anshul Gupta
Sven Schewe
export BibTeX citation

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?)

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?)