Exploring bidding strategies for market-based scheduling

doi:10.1145/779928.779943

Exploring bidding strategies for market-based scheduling

Full Text:

PDF

Buy this Article

Authors:	Michael P. Wellman	University of Michigan, Ann Arbor, MI
	Jeffrey K. MacKie-Mason	University of Michigan, Ann Arbor, MI
	Daniel M. Reeves	University of Michigan, Ann Arbor, MI
	Sowmya Swaminathan	University of Michigan, Ann Arbor, MI

	2003 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 18 · Downloads (cumulative): 780 · Citation Count: 8

Published in:

	· Proceeding
	EC '03 Proceedings of the 4th ACM conference on Electronic commerce
	Pages 115-124 ACM New York, NY, USA ©2003 table of contents ISBN:1-58113-679-X doi>10.1145/779928.779943

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 bidding strategies economics evolutionary game theory evolutionary search experimentation market-based scheduling multiagent systems nash equilibrium replicator dynamics simultaneous ascending auctions

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