OpenAlex
PricingAboutJobs
Log inGet started
Work

Learning Near-Pareto-Optimal Conventions in Polynomial Time

HTML

Year: 2003
Type: article
Source: neural information processing systems
Authors: Xiaofeng Wang, Tüomas Sandholm
Institution: Carnegie Mellon University
Language: English

Topic: Game Theory and Applications
Subfield: Management Science and Operations Research
Field: Decision Sciences
Domain: Social Sciences
Keywords: repeated games, coordination games, multiple equilibria, equilibrium selection, imperfect monitoring, perfect monitoring, learning algorithms, polynomial-time algorithms

Open Access status: closed
OpenAlex ID: W2150170179
FWCI: 1.665
Cites: 18
Cited by: 18
Related to: 9
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