Marbles: A Family of Cooperative Negotiation Schemes for Real-Time Fault-Tolerant Distributed Resource Allocation

Marbles schemes are a family of cooperative and adaptive algorithms for distributed resource allocation problems. Long-term goals for these schemes emphasize faulttolerance and real-time performance in which a good timely solution is preferable to an optimal but too late solution. This paper reports work in progress where we compare the performance and analyze characteristics of different Marbles schemes and centralized solvers working on large scale and complex resource allocation problems.

[1]  Craig Boutilier,et al.  Sequential Auctions for the Allocation of Resources with Complementarities , 1999, IJCAI.

[2]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[3]  Paul R. Milgrom,et al.  Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.

[4]  Donald F. Ferguson,et al.  Economic models for allocating resources in computer systems , 1996 .

[5]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Edmund H. Durfee,et al.  Planning and Resource Allocation for Hard Real-Time, Fault-Tolerant Plan Execution , 1999, Agents.

[8]  Manhoi Choy,et al.  Efficient fault tolerant algorithms for resource allocation in distributed systems , 1992, STOC '92.

[9]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[10]  Michael P. Wellman,et al.  MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability , 2000, AAAI/IAAI.

[11]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[12]  Maria Gini,et al.  Search Strategies for Bid Selection in Multi-Agent Contracting , 1999 .

[13]  Martin Andersson,et al.  Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types , 1999, AAAI/IAAI.

[14]  Victor R. Lesser,et al.  Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework , 1997, ICMAS.

[15]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.

[16]  Michael P. Wellman.  The economic approach to artificial intelligence , 1996, CSUR.

[17]  S. Clearwater.  Market-based control: a paradigm for distributed resource allocation , 1996 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.