Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Adaptive Regret Minimization in Bounded-Memory Games

From MaRDI portal
Publication:3190039
Jump to:navigation, search

DOI10.1007/978-3-319-02786-9_5zbMath1435.91021arXiv1111.2888OpenAlexW2164245297MaRDI QIDQ3190039

Jeremiah Blocki, Arunesh Sinha, Anupam Datta, Nicolas Christin

Publication date: 15 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.2888


zbMATH Keywords

Stackelberg equilibriumrepeated gameimperfect informationperfect informationstochastic game


Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Multistage and repeated games (91A20) Algorithmic game theory and complexity (91A68)





This page was built for publication: Adaptive Regret Minimization in Bounded-Memory Games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3190039&oldid=16328099"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 22:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki