A game-theoretic formulation of multi-agent resource allocation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A game-theoretic formulation of multi-agent resource allocation

Full text

Pdf (736 KB)

Source

International Conference on Autonomous Agents archive
Proceedings of the fourth international conference on Autonomous agents table of contents

Barcelona, Spain

Pages: 349 - 356

Year of Publication: 2000

ISBN:1-58113-230-1

Authors

Jonathan Bredin	Department of Computer Science, Dartmouth College, 6211 Sudikoff Lab, Hanover, NH
Rajiv T. Maheswaran	Coordinated Science Laboratory, University of Illinois, 1308 W. Main Street, Urbana, IL
Çagri Imer	Coordinated Science Laboratory, University of Illinois, 1308 W. Main Street, Urbana, IL
Tamer Başar	Coordinated Science Laboratory, University of Illinois, 1308 W. Main Street, Urbana, IL
David Kotz	Department of Computer Science, Dartmouth College, 6211 Sudikoff Lab, Hanover, NH
Daniela Rus	Department of Computer Science, Dartmouth College, 6211 Sudikoff Lab, Hanover, NH

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGCHI: ACM Special Interest Group on Computer-Human Interaction

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 63, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/336595.337525 What is a DOI?

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	Ravindra K. Ahuja , Thomas L. Magnanti , James B. Orlin, Network flows: theory, algorithms, and applications, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	2	E. Altman, T. Basar, and R. Srikant. Nash equilibria for combined flow control and routing in networks: Asympt o t i c behavior for a large number of users. In Proceedings of 38th IEEE Conference on Decision and Control, Phoenix, AZ, Dec. 1999.
	3	T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. Classics in Applied Mathematics, SIAM, 1999.
	4	Jonathan Bredin , David Kotz , Daniela Rus, Market-based resource control for mobile agents, Proceedings of the second international conference on Autonomous agents, p.197-204, May 10-13, 1998, Minneapolis, Minnesota, United States [doi>10.1145/280765.280801]
	5	Jonathan Bredin , David Kotz , Daniela Rus, Utility Driven Mobile-Agent Scheduling, Dartmouth College, Hanover, NH, 2005
	6	Jonathan Bredin , David Kotz , Daniela Rus, Mobile-Agent Planning in a Market-Oriented Environment, Dartmouth College, Hanover, NH, 1999
	7	K. Calvert and E. Zegura. GT-ITM: Georgia Tech internetwork topology models, 1996. http ://www. cc. gat ech. edu/fac/Ellen. Zegura/ gt-itm/gt-itm, tar. gz.
	8	Man-Tung T. Hsiao , Aurel A. Lazar, Optimal decentralized flow control of Markovian queueing networks with multiple controllers, Performance Evaluation, v.13 n.3, p.181-204, Nov. 1, 1991 [doi>10.1016/0166-5316(91)90054-7]
	9	F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33- 37, 1997.
	10	F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of. the Operational Research Society, 49:237-252, 1998.
	11	Y. Korilis and A. Lazar. Architecting noncooperative networks. IEEE Journal on Selected Areas in Communications, 13:1241-1251, Sept. 1995.
	12	Yannis A. Korilis , Aurel A. Lazar, On the existence of equilibria in noncooperative optimal flow control, Journal of the ACM (JACM), v.42 n.3, p.584-613, May 1995 [doi>10.1145/210346.210415]
	13	Danny B. Lange , Mitsuru Oshima, Seven good reasons for mobile agents, Communications of the ACM, v.42 n.3, p.88-89, March 1999 [doi>10.1145/295685.298136]
	14	C. Langton, R. Burkhart, M. Daniels, and A. Lancaster. The Swarm simulation system, 1999. http ://www. sant af e. edu/proj oct s/swarm.
	15	J. K. Mackie-Mason and H. R. Varian. Pricing congestible network resources. IEEE Journal of Selected Areas in Communications, 13(7):1141-1149, Sept. 1995.
	16	R.T. Maheswaran, C. Imer, and T. Basar. Agent mobility under price incentives. In Proceedings of 38th IEEE Conference on Decision and Control, Phoenix, AZ, Dec. 1999.
	17	Ori Regev , Noam Nisan, The POPCORN market—an online market for computational resources, Proceedings of the first international conference on Information and computation economies, p.148-157, October 25-28, 1998, Charleston, South Carolina, United States [doi>10.1145/288994.289027]
	18	Christian F. Tschudin, Open Resource Allocation for Mobile Code, Proceedings of the First International Workshop on Mobile Agents, p.186-197, April 07-08, 1997
	19	J. E. White. Telescript technology: Mobile agents. General Magic White Paper, 1996.

CITED BY 5

	K. Smith , R. Paranjape , L. Benedicenti, Agent behavior and agent models in unregulated markets, ACM SIGAPP Applied Computing Review, v.9 n.3, p.2-12, Fall 2001
	Yu-Kwong Kwok , Kai Hwang , ShanShan Song, Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation, IEEE Transactions on Parallel and Distributed Systems, v.18 n.5, p.621-636, May 2007
	Rubing Duan , Radu Prodan , Thomas Fahringer, Performance and cost optimization for multiple large-scale grid workflow applications, Proceedings of the 2007 ACM/IEEE conference on Supercomputing, November 10-16, 2007, Reno, Nevada
	Robert S. Gray , George Cybenko , David Kotz , Ronald A. Peterson , Daniela Rus, D'Agents: applications and performance of a mobile-agent system, Software—Practice & Experience, v.32 n.6, p.543-573, May 2002
	Li Chunlin , Li Layuan, A distributed utility-based two level market solution for optimal resource scheduling in computational grid, Parallel Computing, v.31 n.3+4, p.332-351, March/April 2005