Dartmouth College Computer Science
Technical Report series
TR search TR listserv
|By author:||A B C D E F G H I J K L M N O P Q R S T U V W X Y Z|
|By number:||2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
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.
Submitted to "Autonomous Agents 2000".
See related papers.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Jonathan Bredin, Rajiv T. Maheswaran, Cagri Imer, Tamer Basar, David Kotz, and Daniela Rus, "A Game-Theoretic Formulation of Multi-Agent Resource Allocation." Dartmouth Computer Science Technical Report PCS-TR99-360, October 1999.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.