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

Complexity and effective prediction

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

DOI10.1016/j.geb.2009.05.007zbMath1229.91059OpenAlexW2160305771MaRDI QIDQ972136

Abraham Neyman, J. H. Spencer

Publication date: 25 May 2010

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2009.05.007



Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)


Related Items (2)

The complexity of interacting automata ⋮ Correlation through bounded recall strategies



Cites Work

  • Unnamed Item
  • Two-person repeated games with finite automata
  • Repeated games with finite automata
  • Finitely Repeated Games with Finite Automata


This page was built for publication: Complexity and effective prediction

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