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

How complex are networks playing repeated games?

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

DOI10.1007/s001990050243zbMath0918.90149OpenAlexW2090947688MaRDI QIDQ1275882

Hao Li, In-Koo Cho

Publication date: 4 August 1999

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001990050243


zbMATH Keywords

networkcomplexityrepeated gamesrepeated playlocally stable equilibriumnetworks with finitely many classifiers


Mathematics Subject Classification ID

Games involving graphs (91A43) Multistage and repeated games (91A20)


Related Items

Perceptron versus automaton in the finitely repeated prisoner's dilemma



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