Article

Resource allocation games with changing resource capacities

Authors:

Shashikiran Kolar,

Kristina LermanAuthors Info & Claims

AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems

Pages 145 - 152

https://doi.org/10.1145/860575.860599

Published: 14 July 2003 Publication History

Abstract

In this paper we study a class of resource allocation games which are inspired by the El Farol Bar problem. We consider a system of competitive agents that have to choose between several resources characterized by their time dependent capacities. The agents using a particular resource are rewarded if their number does not exceed the resource capacity, and punished otherwise. Agents use a set of strategies to decide what resource to choose, and use a simple reinforcement learning scheme to update the accuracy of strategies. A strategy in our model is simply a lookup table that suggests to an agent what resource to choose based on the actions of its neighbors at the previous time step. In other words, the agents form a social network whose connectivity controls the average number of neighbors with whom each agent interacts. This statement of the adaptive resource allocation problem allows us to fully parameterize it by a small set of numbers. We study the behavior of the system via numeric simulations of 100 to 5000 agents using one to ten resources. Our results indicate that for a certain range of parameters the system as a whole adapts effectively to the changing capacity levels and results in very little under- or over-utilization of the resources.

References

[1]

W. B. Arthur. Inductive reasoning and bounded rationality. American Economic Review, 84:406--411, 1994.

[2]

R. Axelrod and W. D. Hamilton. The evolution of cooperation. Science, 211:1390--1396, 1981.

[3]

C. Boutilier, M. Goldszmidt, and B. Sabata. Sequential Auctions for the Allocation of Resources with Complimentarities. In International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, Aug. 1999.

Digital Library

[4]

A. Cavagna. Irrelevance of memory in the minority game. Phys. Rev. E, 59:R3783, 1999.

[5]

D. Challet and M. Marsili. Phase transition and symmetry breaking in the minority game. Phys. Rev. E, 60:R6271, 1999.

[6]

D. Challet and Y.-C. Zhang. Emergence of cooperation and organization in an evolutionary game. Physica A, page 407, 1997.

[7]

D. Challet and Y.-C. Zhang. On the minority game: Analytical and numerical studies. Physica A, 256:514, 1998.

[8]

A. Chavez, A. Moukas, and P. Maes. Challenger: A Multi-agent System for Distributed Resource Allocation. In Proc. of Autonomous Agents, Marina del Rey, CA, Feb. 1997.

Digital Library

[9]

C. Claus and C. Boutilier. The dynamics of reinforcement learning in cooperative multiagent systems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), pages 746--752, July 1998.

Digital Library

[10]

D. Fudenberg and D. K. Levine. The Theory of Learning in Games. MIT Press, Cambridge, MA, 1998.

[11]

A. Galstyan and K. Lerman. Adaptive boolean networks and minority games with time-dependent capacities. Physical Review, E66:015103, 2002.

[12]

N. Johnson, P. Hui, D. Zheng, and C. Tai. Minority game with arbitrary cuttoffs. Physica A, 269:493, 1999.

[13]

S. Kapetanakis and D. Kudenko. Reinforcement learning of coordination in cooperative multi agent systems. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-02), Edmonton, Alberta, Canada, July 2002.

Digital Library

[14]

S. A. Kauffman. The Origins of Order. Oxford University Press, New York, 1993.

[15]

J. F. Kurose and R. Simha. A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Transactions on Computers, 38(5):705--717, 1989.

Digital Library

[16]

See http://www.unifr.ch/econophysics/minority/ for an extensive collection of articles and references.

[17]

T. Mullen and M. Wellman. Market-Based Negotiation for Digital Library Services. In Proc. of the 2nd USENIX Workshop on Electronic Commerce, Oakland, CA, Nov. 1996.

[18]

R. W. Rosenthal. A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory, 2:65--67, 1973.

Digital Library

[19]

T. Sandholm. Limitations of the Vickrey Auction in Computational Multiagent Systems. In International Conference on Multi-Agent Systems (ICMAS), pages 299--306, Kyoto, Japan, Dec. 1996.

[20]

T. Sandholm. An Algorithm for Optimal Winner Determination in Combinatorial Auctions. In International Joint Conference on Artificial Intelligence (IJCAI), pages 542--547, Stockholm, Sweden, Aug. 1999.

Digital Library

[21]

T. Sandholm and S. Suri. Market Clearability. In International Joint Conference on Artificial Intelligence (IJCAI), pages 1145--1151, Seattle, WA, 2001.

Digital Library

[22]

R. Savit, R. Manuca, and R. Riolo. Adaptive competition, market efficiency, phase transition. Phys. Rev. Lett., 82(10):2203, 1999.

[23]

A. Schaerf, Y. Shoham, and M. Tennenholtz. Adaptive load balancing: A study in multi-agent learning. Journal of Artificial Intelligence Research, 2:475--500, 1995.

Digital Library

[24]

S. Sen, M. Sekaran, and J. Hale. Learning to coordinate without sharing information. In (American) National Conference on Artificial Intelligence, pages 426--431, Menlo Park, CA, 1994. AAAI Press.

Digital Library

[25]

R. G. Smith. The Contract Net Protocol. IEEE Tranactions on Computers, 29(12):1104--1113, Dec. 1980.

Digital Library

[26]

R. V. Sole, B. Luque, and S. A. Kauffman. Phase Transitions in Random Networks with Multiple States. SFI Working Papers, 00-02-011, 2000.

[27]

M. Tan. Multi-Agents Reinforcement Learning: Independent vs Cooperative agents. In Proceeding of the $10^th$ International Conference on Machine Learning (ICML-93), 1993.

[28]

J. M. Vidal and E. H. Durfee. The moving target function problem in multi-agent learning. In Proceedings of the 3rd International Conference on Multi-Agent Systems (ICMAS-98), 1998.

Digital Library

[29]

J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ, 1944.

[30]

W. E. Walsh and M. P. Wellman. A Market Protocol for Decentralized Task Allocation. In International Conference on Multi-Agent Systems (ICMAS), Paris, France, July 1998.

Digital Library

[31]

C. J. C. H. Watkins. Learning from Delayed Rewards. PhD thesis, Cambridge University, Cambridge, England, 1989.

[32]

M. P. Wellman. Market-Oriented Programming: Some Early Lessons. In S. H. Clearwater, editor, Market-Based Control: A Paradigm for Distributed Resource Allocation, pages 74--95. World Scientific, Jan. 1996.

Digital Library

[33]

F. Ygge and H. Akkermans. Decentralized Markets versus Central Control: A Comparative Study. Journal of Artificial Intelligence Research, 11:301--333, 1999.

Digital Library

Cited By

ÇETİNER BYAŞARCAN H(2023)The El Farol Bar Problem: A Comparative Analysis of Expectation Models Used in Decision MakingThe El Farol Bar Problem: Karar Vermede Kullanılan Farklı Beklenti Modellerinin Karşılaştırılmalı AnaliziEndüstri Mühendisliği10.46465/endustrimuhendisligi.1264061Online publication date: 29-Jul-2023
https://doi.org/10.46465/endustrimuhendisligi.1264061
Montes CValdez A(2018)A Three-Choice Minority Game Model with Homogeneous Agent Preferences for Resource AllocationProcedia Computer Science10.1016/j.procs.2018.10.292140(56-63)Online publication date: 2018
https://doi.org/10.1016/j.procs.2018.10.292
Seyednezhad SShinseki ERomero DMenezes R(2017)Weighted Multi-resource Minority GamesIntelligent Systems and Applications10.1007/978-3-319-69266-1_14(285-305)Online publication date: 31-Dec-2017
https://doi.org/10.1007/978-3-319-69266-1_14
Show More Cited By

Index Terms

Resource allocation games with changing resource capacities
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Cooperation and coordination
      2. Multi-agent systems

Recommendations

Resource reconstruction algorithms for on-demand allocation in virtual computing resource pool

Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the idea of resource virtualization and ...
Reinforcement Learning-Based Resource Allocation in Edge Computing
Artificial Intelligence and Security
Abstract
The problem of online resource allocation in edge computing has become a research hotspot. Meanwhile, reinforcement learning (RL) is suitable for solving online problems. In this paper, we combine edge computing online resource allocation with RL. ...
Optimizing cloud resource allocation: A long short-term memory and DForest-based load balancing approach

Load balancing is an element that must exist for a cloud server to function properly. Without it, there would be substantial lag and the server won’t be able to operate as intended. In a Cloud computing (CC) establishing, load balancing is the process of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems

July 2003

1200 pages

ISBN:1581136838

DOI:10.1145/860575

General Chairs:
Jeffrey S. Rosenschein
Israel
,
Michael Wooldridge
UK
,
Program Chairs:
Tuomas Sandholm
USA
,
Makoto Yokoo
Japan

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 July 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

AAMAS03

Sponsor:

AAMAS03: Second International Conference on Autonomous Agents and Multiagent Systems

July 14 - 18, 2003

Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
1,205
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)5

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

ÇETİNER BYAŞARCAN H(2023)The El Farol Bar Problem: A Comparative Analysis of Expectation Models Used in Decision MakingThe El Farol Bar Problem: Karar Vermede Kullanılan Farklı Beklenti Modellerinin Karşılaştırılmalı AnaliziEndüstri Mühendisliği10.46465/endustrimuhendisligi.1264061Online publication date: 29-Jul-2023
https://doi.org/10.46465/endustrimuhendisligi.1264061
Montes CValdez A(2018)A Three-Choice Minority Game Model with Homogeneous Agent Preferences for Resource AllocationProcedia Computer Science10.1016/j.procs.2018.10.292140(56-63)Online publication date: 2018
https://doi.org/10.1016/j.procs.2018.10.292
Seyednezhad SShinseki ERomero DMenezes R(2017)Weighted Multi-resource Minority GamesIntelligent Systems and Applications10.1007/978-3-319-69266-1_14(285-305)Online publication date: 31-Dec-2017
https://doi.org/10.1007/978-3-319-69266-1_14
Nezarat ADastghaibyfard G(2016)A game theoretical model for profit maximization resource allocation in cloud environment with budget and deadline constraintsThe Journal of Supercomputing10.1007/s11227-016-1782-z72:12(4737-4770)Online publication date: 24-Jun-2016
https://doi.org/10.1007/s11227-016-1782-z
Caporuscio MD’Angelo MGrassi VMirandola R(2016)Reinforcement Learning Techniques for Decentralized Self-adaptive Service AssemblyService-Oriented and Cloud Computing10.1007/978-3-319-44482-6_4(53-68)Online publication date: 25-Aug-2016
https://doi.org/10.1007/978-3-319-44482-6_4
Nezarat ADastghaibifard G(2015)Efficient Nash Equilibrium Resource Allocation Based on Game Theory Mechanism in Cloud Computing by Using AuctionPLOS ONE10.1371/journal.pone.013842410:10(e0138424)Online publication date: 2-Oct-2015
https://doi.org/10.1371/journal.pone.0138424
Schlegel TKowalczyk R(2013)Self-Organizing Nomadic Services in GridsAdvances in Applied Self-Organizing Systems10.1007/978-1-4471-5113-5_10(263-293)Online publication date: 2013
https://doi.org/10.1007/978-1-4471-5113-5_10
Epstein DBazzan AMachado A(2012)Break with agents who listen to too many others (at least when making Boolean decisions!)Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2343896.2344021(1389-1390)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343896.2344021
Ahmed WShafique MBauer LHenkel JDick RMadsen J(2011)Adaptive resource management for simultaneous multitasking in mixed-grained reconfigurable multi-core processorsProceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis10.1145/2039370.2039426(365-374)Online publication date: 9-Oct-2011
https://dl.acm.org/doi/10.1145/2039370.2039426
Shafique MBauer LAhmed WHenkel J(2011)Minority-Game-based resource allocation for run-time reconfigurable multi-core processors2011 Design, Automation & Test in Europe10.1109/DATE.2011.5763202(1-6)Online publication date: Mar-2011
https://doi.org/10.1109/DATE.2011.5763202
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents