Coalitions among computationally bounded agents
From MaRDI portal
Publication:1391349
DOI10.1016/S0004-3702(97)00030-1zbMath0904.68167MaRDI QIDQ1391349
Victor R. Lesser, Tuomas W. Sandholm
Publication date: 22 July 1998
Published in: Artificial Intelligence (Search for Journal in Brave)
game theorybounded rationalitymultiagent systemsresource-bounded reasoningnegotiationcoalition formationdistributed AI
Related Items (20)
Conflict analysis ⋮ Characteristic function games with restricted agent interactions: core-stability and coalition structures ⋮ A linear approximation method for the Shapley value ⋮ Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach ⋮ Negotiation and cooperation in multi-agent environments ⋮ Behavioral strong implementation ⋮ On the computational complexity of coalitional resource games ⋮ Complexity of constructing solutions in the core based on synergies among coalitions ⋮ Leveled commitment contracts and strategic breach ⋮ Principles and applications of continual computation ⋮ Comparison of distributed methods for resource allocation ⋮ Human centered processes and decision support systems ⋮ Plan-Coordination Mechanisms and the Price of Autonomy ⋮ Bargaining with limited computation: Deliberation equilibrium ⋮ Methods for task allocation via agent coalition formation ⋮ An algorithm for distributing coalitional value calculations among cooperating agents ⋮ Dynamics of Profit-Sharing Games ⋮ Leveled commitment contracts with myopic and strategic agents ⋮ A new algebraic modelling approach to distributed problem-solving in MAS ⋮ Anytime coalition structure generation: an average case study
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coalition-proof Nash equilibria. I: Concepts
- Coalition-proof Nash equilibria. II: Applications
- Deliberation scheduling for problem solving in time-constrained environments
- Multiagent negotiation under time constraints
- On the nucleolus of the basic vehicle routing game
- Optimal composition of real-time systems
- On complexity as bounded rationality (extended abstract)
- Sequential Equilibria
- Coalition formation processes with belief revision among bounded-rational self-interested agents
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Equilibrium points in n -person games
- Principles and applications of continual computation
This page was built for publication: Coalitions among computationally bounded agents