Methods for task allocation via agent coalition formation
From MaRDI portal
Publication:1274277
DOI10.1016/S0004-3702(98)00045-9zbMath0908.68032OpenAlexW1971441460MaRDI QIDQ1274277
Publication date: 12 January 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00045-9
Related Items
Reasoning about coalitional games ⋮ Overlapping coalitions, bargaining and networks ⋮ Managing parallel inquiries in agents' two-sided search ⋮ A linear approximation method for the Shapley value ⋮ The effects of co-operation on multiagent search in task-oriented domains ⋮ An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games ⋮ Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies ⋮ Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability ⋮ Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games ⋮ Cooperative concurrent games ⋮ Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets ⋮ Coalition structure generation: a survey ⋮ A hybrid exact algorithm for complete set partitioning ⋮ On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information ⋮ Randomized coalition structure generation ⋮ Fair linking mechanisms for resource allocation with correlated player types ⋮ Locality-sensitive task allocation and load balancing in networked multiagent systems: talent versus centrality ⋮ Generalized multi-cluster game under partial-decision information with applications to management of energy Internet ⋮ Multiple UAV coalitions for a search and prosecute mission ⋮ Information systems in modeling interactive computations on granules ⋮ Multiobjective interaction programming problem with interaction constraint for two players ⋮ On the computational complexity of coalitional resource games ⋮ Complexity of constructing solutions in the core based on synergies among coalitions ⋮ Coalition formation in social environments with logic-based agents1 ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents ⋮ On agent-based software engineering ⋮ Failure risk propagation and protection schemes in coupled systems ⋮ MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems ⋮ Anytime coalition structure generation in multi-agent systems with positive or negative externalities ⋮ Comparison of distributed methods for resource allocation ⋮ Joint search with self-interested agents and the failure of cooperation enhancers ⋮ On the computational complexity of weighted voting games ⋮ Solving coalitional resource games ⋮ Interactive information systems: toward perception based computing ⋮ Plan-Coordination Mechanisms and the Price of Autonomy ⋮ Collaborative transportation with overlapping coalitions ⋮ Hyper-distributed hyper-parallel self-organizing dynamic scheduling based on solitary wave ⋮ Web services composing by multiagent negotiation ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ A New Solution Concept for Coalitional Games in Open Anonymous Environments ⋮ Negotiating team formation using deep reinforcement learning ⋮ Verifying Team Formation Protocols with Probabilistic Model Checking ⋮ An algorithm for distributing coalitional value calculations among cooperating agents ⋮ Improved WPM encoding for coalition structure generation under MC-nets ⋮ Deep reinforcement learning with emergent communication for coalitional negotiation games ⋮ The grand surplus value and repeated cooperative cross-games with coalitional collaboration ⋮ A LATTICE-BASED APPROACH TO THE PROBLEM OF RECRUITMENT IN MULTIAGENT SYSTEMS ⋮ The Application of Multi-agent Robotic Systems for Earthquake Rescue ⋮ A new algebraic modelling approach to distributed problem-solving in MAS ⋮ On the computational complexity of qualitative coalitional games ⋮ Anytime coalition structure generation: an average case study
Cites Work
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
- A new bargaining set of an \(N\)-person game and endogenous coalition formation
- Coalitions among computationally bounded agents
- Multiagent negotiation under time constraints
- Degenerate scale for the Laplace problem in the half-plane; approximate logarithmic capacity for two distant boundaries
- Optimal scheduling for two-processor systems
- Von Neumann-Morgenstern solutions to cooperative games without side payments
- The Core of a Cooperative Game Without Side Payments
- A Greedy Heuristic for the Set-Covering Problem
- Cooperation and conflict resolution via negotiation among autonomous agents in noncooperative domains
- Note—A Computational Survey of Methods for the Set Covering Problem
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- On the Set-Covering Problem
- A Simplified Bargaining Model for the n-Person Cooperative Game
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
