Methods for Task Allocation via Agent Coalition Formation

[1]  Pedro S. de Souza,et al.  Asynchronous Teams: Cooperation Schemes for Autonomous Agents , 1998, J. Heuristics.

[2]  Edmund H. Durfee,et al.  Distributed artificial intelligence , 1998 .

[3]  Michael P. Wellman,et al.  A market protocol for decentralized task allocation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[4]  Anatol Rapoport,et al.  Theories of Coalition Formation , 1998 .

[5]  Somesh Jha,et al.  Multi-Agent Coordination through Coalition Formation , 1997, ATAL.

[6]  Marian H. Nodine,et al.  Facilitating Open Communication in Agent Systems: The InfoSleuth Infrastructure , 1997, ATAL.

[7]  Victor R. Lesser,et al.  Coalitions Among Computationally Bounded Agents , 1997, Artif. Intell..

[8]  Katia P. Sycara,et al.  Designing behaviors for information agents , 1997, AGENTS '97.

[9]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[10]  F. Post,et al.  An Economics Approach to Hard Computational Problems , 1997 .

[11]  Katia P. Sycara,et al.  Middle-Agents for the Internet , 1997, IJCAI.

[12]  Katia P. Sycara,et al.  Distributed Intelligent Agents , 1996, IEEE Expert.

[13]  Sarit Kraus,et al.  An Overview of Incentive Contracting , 1996, Artif. Intell..

[14]  Katia P. Sycara,et al.  Coordination of Multiple Intelligent Software Agents , 1996, Int. J. Cooperative Inf. Syst..

[15]  Sarosh Talukdar,et al.  Asynchronous teams : cooperation schemes for autonomous, computer-based agents , 1996 .

[16]  Sarit Kraus,et al.  Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents * , 1996 .

[17]  G. Tidhar,et al.  Guided Team Selection * , 1996 .

[18]  Keith Decker,et al.  Unified Information and Control Flow in Hierarchical Task Networks , 1996 .

[19]  Samir Khuller,et al.  The loading time scheduling problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[20]  Sarit Kraus,et al.  Task Allocation Via Coalition Formation Among Autonomous Agents , 1995, IJCAI.

[21]  Nicholas R. Jennings,et al.  Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions , 1995, Artif. Intell..

[22]  Sarit Kraus,et al.  Multiagent Negotiation under Time Constraints , 1995, Artif. Intell..

[23]  Daniel Kuokka,et al.  On Using KQML for Matchmaking , 1995, ICMAS.

[24]  Michael P. Wellman,et al.  A Simple Computational Market for Network Information Services , 1995, ICMAS.

[25]  Jeffrey S. Rosenschein,et al.  Coalition, Cryptography, and Stability: Mechanisms for Coalition Formation in Task Oriented Domains , 2018, AAAI.

[26]  Steven P. Ketchpel.  Forming Coalitions in the Face of Uncertain Rewards , 1994, AAAI.

[27]  Lin Zhou,et al.  A New Bargaining Set of an N-Person Game and Endogenous Coalition Formation , 1994 .

[28]  Sarit Kraus,et al.  Coalition Formation Among Autonomous Agents: Strategies and Complexity , 1993, MAAMAW.

[29]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[30]  Michael P. Wellman.  A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[31]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[32]  M. Georgeff,et al.  Social Plans: A Preliminary Report , 1992 .

[33]  G. Zlotkin,et al.  Cooperation and conflict resolution via negotiation among autonomous agents in noncooperative domains , 1991, IEEE Trans. Syst. Man Cybern..

[34]  Gen-Huey Chen,et al.  A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[35]  Katia Sycara,et al.  Persuasive argumentation in negotiation , 1990 .

[36]  Edmund H. Durfee,et al.  Negotiating Task Decomposition and Allocation Using Partial Global Planning , 1989, Distributed Artificial Intelligence.

[37]  Jeffrey S. Rosenschein,et al.  Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains , 1989, IJCAI.

[38]  E. Rasmussen.  Games and Information , 1989 .

[39]  L. Shapley.  A Value for n-person Games , 1988 .

[40]  Alan H. Bond,et al.  Readings in Distributed Artificial Intelligence , 1988 .

[41]  Eric Werner,et al.  Toward a Theory of Communication and Cooperation for Multiagent Planning , 1988, TARK.

[42]  Wen-Hsiang Tsai,et al.  Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search , 1988, BIT.

[43]  A. H. Bond.  An Analysis of Problems and Research in DAI , 1988 .

[44]  Edmund H. Durfee,et al.  Coherent Cooperation Among Communicating Problem Solvers , 1987, IEEE Transactions on Computers.

[45]  Edmund H. Durfee,et al.  Using Partial Global Plans to Coordinate Distributed Problem Solvers , 1987, IJCAI.

[46]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[47]  A. Michalos.  Rational Behavior and Bargaining Equilibrium in Games and Social Situations , 1982 .

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

[49]  Reid G. Smith,et al.  A Framework for Distributed Problem Solving , 1979, IJCAI.

[50]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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

[52]  Egon Balas,et al.  On the Set-Covering Problem: II. An Algorithm for Set Partitioning , 1972, Oper. Res..

[53]  Oscar H. Ibarra,et al.  On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints , 1975 .

[54]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[55]  Anatol Rapoport,et al.  N-Person Game Theory , 1970 .

[56]  George L. Nemhauser,et al.  The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[57]  John C. Harsanyi,et al.  A Simplified Bargaining Model for the n-Person Cooperative Game , 1963 .

[58]  R. Aumann.  The core of a cooperative game without side payments , 1961 .

[59]  H. Raiffa,et al.  Games and Decisions. , 1960 .

[60]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .