Using shadow prices for resource allocation in a combinatorial grid with proxy-bidding agents

ICEIS 2006 - 8th International Conference on Enterprise Information Systems, Proceedings

Volumn SAIC, Issue , 2006, Pages 11-18

  Schwind, Michael ^a   Gujo, Oleg ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Agent oriented programming; Combinatorial auction; Grid computing; Resource allocation

Indexed keywords

AGENT BASED SIMULATION; AGENT-ORIENTED PROGRAMMING; ALLOCATION MECHANISM; BIDDING AGENTS; BIDDING PROCESS; CLOSED LOOPS; COMBINATORIAL AUCTION; COMMUNICATION BANDWIDTH; CPU TIME; GRID SYSTEMS; LINEAR PROGRAMMING FORMULATION; NON-VOLATILE MEMORIES; PRICING MECHANISM; RESOURCE PRICE; SHADOW PRICE; TASK-SCHEDULING;

COMPUTER SIMULATION; COSTS; GRID COMPUTING; INFORMATION SYSTEMS; LINEAR PROGRAMMING; LINEARIZATION; RESOURCE ALLOCATION; SCHEDULING; TELECOMMUNICATION SYSTEMS;

ECONOMICS;

EID: 77953876919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. AuYoung, A., Chun, B. N., Snoeren, A. C., and Vahdat, A. (2004). Resource allocation in federated distributed computing infrastructures. In Proceedings of the 1st Workshop on Operating System and Architectural Support, San Francisco, USA.
2. Bjørndal, M. and Jørnsten, K. (2001). An analysis of a combinatorial auction. Technical Report 2001-11, Department of Finance and Management Science, Norwegian School of Economics and Business Administration, Bergen, Norway.
3. Buyya, R., Stockinger, H., Giddy, J., and Abramson, D. (2001). Economic models for management of resources in peer-to-peer and grid computing. In Proceedings of the SPIE International Conference on Commercial Applications for High-Performance Computing, Denver, USA.
4. Chun, B. N., Buonadonna, P., AuYoung, A., Ng, C., Parkes, D. C., Shneiderman, J., Snoeren, A. C., and Vahdat, A. (2004). Mirage: A microeconomic resource allocation system for sensornet testbeds. In Proceedings of the 2nd IEEEWorkshop on Embedded Networked Sensors (EmNetS-II); Sidney, Australia.
5. Fujishima, Y., Leyton-Brown, K., and Shoham, Y. (1999). Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proceedings of the 16th International Joint Conference on Artificial Intelligence 1999 (IJCAI-99), Stockholm, Sweden, pages 548-553.
6. Kwasnica, A. M., Ledyard, J., Porter, D., and DeMartini, C. (2005). A new and improved design for multiobjective iterative auctions. Management Science, 51(3):419-434.
7. Nisan, N. (2005). Bidding languages. In Steinberg, R., Shoham, Y., and Cramton, P., editors, Combinatorial Auctions. MIT-Press.
8. Parkes, D. C. and Ungar, L. H. (2000). Iterative combinatorial auctions: Theory and practice. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00), pages 74-81.
9. Rassenti, J. S., Smith, V. L., and Bulfin, R. L. (1982). A combinatorial auction mechanism for airport time slot allocation. Bell Journ. of Economics, 13(2):402-417.
10. Schwind, M., Stockheim, T., and Rothlauf, F. (2003). Optimization heuristics for the combinatorial auction problem. In Proceedings of the Congress on Evolutionary Computation CEC 2003, pages 1588-1595.
11. Vries, S. D. and Vohra, R. (2001). Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3):284-309.
12. Xia, M., Koehler, G. J., and Whinston, A. B. (2004). Pricing combinatorial auctions. European Journal of Operational Research, 154(1):251-270.