Playing games in many possible worlds

doi:10.1145/1134707.1134724

Playing games in many possible worlds

Full Text:

Pdf

Buy this Article

Authors:	Matt Lepinski	MIT, Cambridge, MA
	David Liben-Nowell	Carleton College, Northfield, MN
	Seth Gilbert	MIT, Cambridge, MA
	April Rasala Lehman	Google, Inc., Mountain View, CA

	2006 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 23 · Downloads (cumulative): 698 · Citation Count: 0

Published in:

· Proceeding

EC '06 Proceedings of the 7th ACM conference on Electronic commerce

Pages 150 - 159
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-236-4 doi>10.1145/1134707.1134724

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- EC '13

Share:

|

Tags: algorithms algorithms analysis of algorithms and problem complexity correlated equilibria economics economics game theory information acquisition nash equilibria socratic games theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder