ACM Home Page
Please provide us with feedback. Feedback
Addressing strategic behavior in a deployed microeconomic resource allocator
Full text PdfPdf (206 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems table of contents
Philadelphia, Pennsylvania, USA
SESSION: Markets table of contents
Pages: 99 - 104  
Year of Publication: 2005
ISBN:1-59593-026-4
Authors
Chaki Ng  Harvard University
Philip Buonadonna  Intel Research Berkeley
Brent N. Chun  Intel Research Berkeley
Alex C. Snoeren  UC San Diego
Amin Vahdat  UC San Diego
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 28,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080192.1080195
What is a DOI?

ABSTRACT

While market-based systems have long been proposed as solutions for distributed resource allocation, few have been deployed for production use in real computer systems. Towards this end, we present our initial experience using Mirage, a microeconomic resource allocation system based on a repeated combinatorial auction. Mirage allocates time on a heavily-used 148-node wireless sensor network testbed. In particular, we focus on observed strategic user behavior over a four-month period in which 312,148 node hours were allocated across 11 research projects. Based on these results, we present a set of key challenges for market-based resource allocation systems based on repeated combinatorial auctions. Finally, we propose refinements to the system's current auction scheme to mitigate the strategies observed to date and also comment on some initial steps toward building an approximately strategyproof repeated combinatorial auction.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Crossbow corporation. http://www.xbow.com.
 
2
Buyya, R., Abramson, D., and Giddy, J. NimrodG: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid. In Proceedings of the 4th International Conference on High Performance Computing in Asia-Pacific Region (May 2000).
 
3
Chun, B. N., Buonadonna, P., AuYoung, A., Ng, C., Parkes, D. C., Shneidman, J., Snoeren, A. C., and Vahdat, A. Mirage: A Microeconomic Resource Allocation System for SensorNet Testbeds. In Proceedings of the 2nd IEEE Workshop on Embedded Networked Sensors (May 2005).
 
4
Clarke, E. H. Multipart pricing of public goods. Public Choice 2 (1971), 19--33.
 
5
 
6
Groves, T. Incentives in Teams. Econometrica 41 (1973), 617--631.
7
 
8
Jackson, M. O. Mechanism Theory. In The Encyclopedia of Life Support Systems. EOLSS Publishers, 2000.
 
9
Lai, K., Huberman, B. A., and Fine, L. Tycoon: A Distributed Market-based Resource Allocation System. Tech. rep., Hewlett Packard, 2004.
 
10
11
12
13
14
15
16
17
 
18
Varian, H., and MacKie-Mason, J. K. Generalized Vickrey auctions. Tech. rep., University of Michigan, 1995.
 
19
Vickrey, W. Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance (1961), 8--37.
 
20


Collaborative Colleagues:
Chaki Ng: colleagues
Philip Buonadonna: colleagues
Brent N. Chun: colleagues
Alex C. Snoeren: colleagues
Amin Vahdat: colleagues