Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Smart IPA Phonetic Keyboard
Latex Math Equation to Image
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
118
Voted
NIPS
2003
152
views
Information Technology
»
more
NIPS 2003
»
Learning Near-Pareto-Optimal Conventions in Polynomial Time
15 years 4 months ago
Download
www-2.cs.cmu.edu
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
claim paper
Read More »