A Game-Theoretic Formulation of Multi-Agent Resource Allocation

Authors

Jonathan Bredin, Dartmouth CollegeFollow
Rajiv T. Maheswaran, University of Illinois at Urbana-Champaign
Cagri Imer, University of Illinois at Urbana-Champaign
Tamer Basar, University of Illinois at Urbana-Champaign
David Kotz, Dartmouth College
Daniela Rus, Dartmouth College

Document Type

Technical Report

Publication Date

10-1999

Technical Report Number

PCS-TR99-360

Abstract

This paper considers resource allocation in a network with mobile agents competing for computational priority. We formulate this problem as a multi-agent game with the players being agents purchasing service from a common server. We show that there exists a computable Nash equilibrium when agents have perfect information into the future. We simulate a network of hosts and agents using our strategy to show that our resource-allocation mechanism effectively prioritizes agents according to their endowments.

Comments

Submitted to "Autonomous Agents 2000".

Dartmouth Digital Commons Citation

Bredin, Jonathan; Maheswaran, Rajiv T.; Imer, Cagri; Basar, Tamer; Kotz, David; and Rus, Daniela, "A Game-Theoretic Formulation of Multi-Agent Resource Allocation" (1999). Computer Science Technical Report PCS-TR99-360. https://digitalcommons.dartmouth.edu/cs_tr/235