OpenAlex
PricingAboutJobs
Log inGet started
Work

A polynomial-time nash equilibrium algorithm for repeated games

HTML

Year: 2003
Type: conference-paper
Source: ACM Conference on Electronic Commerce (EC)
Parent work: Proceedings of the 4th ACM conference on Electronic commerce
DOI: 10.1145/779928.779935
Authors: Michael L. Littman, Peter Stone
Institutions: Rutgers, The State University of New Jersey, The University of Texas at Austin
Language: English

Topic: Game Theory and Applications
Subfield: Management Science and Operations Research
Field: Decision Sciences
Domain: Social Sciences
Keywords: Nash equilibrium computation, repeated games, bimatrix games, polynomial-time algorithms, folk theorem, general-sum games, computational complexity

Open Access status: closed

Funder: Defense Advanced Research Projects Agency
OpenAlex ID: W2121180068
FWCI: 9.237
Cites: 23
Cited by: 120
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security