(Enter summary)
Abstract: This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate efficiently in the world. By colluding (coordinating their actions by solving a joint optimization problem) the agents can sometimes save costs compared to operating individually. A model of bounded rationality is adopted where computation resources are costly. It is not worthwhile solving the problems optimally: solution quality is decision-theoretically traded off... (Update)
Cited by: More
Role of acquaintance models in agent's private and.. - Pechoucek, Marik, Barta (2006)
(Correct)
Complexity of Constructing Solutions in the Core Based on.. - Conitzer, Sandholm (2006)
(Correct)
Computing Shapley Values, Manipulating Value Division.. - Conitzer, Sandholm (2004)
(Correct)
Similar documents (at the sentence level):
14.6%: Coalition Formation among Bounded Rational Agents - Sandholm, Lesser (1995)
(Correct)
6.1%: Coalition Structure Generation with Worst Case Guarantees - Sandholm, Larson.. (1999)
(Correct)
5.6%: Distributed Rational Decision Making - Sandholm (1999)
(Correct)
Active bibliography (related documents): More All
0.7: Issues in Automated Negotiation and Electronic Commerce.. - Sandholm, Lesser (1995)
(Correct)
0.6: Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002)
(Correct)
0.5: An Implementation of the Contract Net Protocol Based on Marginal .. - Sandholm (1993)
(Correct)
Similar documents based on text: More All
0.6: Tuomas W. Sandholm and Victor R. Lesser - Computer Science Department (1994)
(Correct)
0.4: Limitations of the Vickrey Auction in Computational Multiagent.. - Sandholm (1996)
(Correct)
0.4: Anytime Coalition Structure Generation with Worst.. - Sandholm, Larson.. (1998)
(Correct)
Related documents from co-citation: More All
13: Methods for task allocation via agent coalition formation
- Shehory, Kraus - 1998
11: An implementation of the contract net protocol based on marginal cost calculatio..
- Sandholm - 1993
11: Rules of Encounter: Designing Conventions for Automated Negotiation Among Comput.. (context) - Rosenschein, Zlotkin - 1994
BibTeX entry: (Update)
Sandholm, T. and Lesser, V., Coalitions among Computationally Bounded Agents, Artificial Intelligence, special issue on Principles of Multi-Agent Systems, forthcoming. http://citeseer.ist.psu.edu/8980.html More
@article{ sandholm97coalitions,
author = "Tuomas Sandholm and Victor R. Lesser",
title = "Coalitions Among Computationally Bounded Agents",
journal = "Artificial Intelligence",
volume = "94",
number = "1-2",
pages = "99-137",
year = "1997",
url = "citeseer.ist.psu.edu/8980.html" }
Citations (may not include all citations):
309
Game Theory (context) - Fudenberg, Tirole - 1991
246
Readings in Distributed Artificial Intelligence (context) - Bond, Gasser - 1988
184
A market-oriented programming environment and its applicatio..
- Wellman - 1993 DBLP
177
An implementation of the contract net protocol based on marg..
- Sandholm - 1993
137
Issues in automated negotiation and electronic commerce: Ext..
- Sandholm, Lesser - 1995
137
Do the right thing: Studies in Limited Rationality (context) - Russell, Wefald - 1991
124
The Art and Science of Negotiation (context) - Raiffa - 1982
114
Oxford University Press (context) - Mas-Colell, Whinston et al. - 1995
89
Limitations of the Vickrey auction in computational multiage..
- Sandholm - 1996
89
Deliberation scheduling for problem solving in timeconstrain.. (context) - Boddy, Dean - 1994
84
Advantages of a leveled commitment contracting protocol
- Sandholm, Lesser - 1996 ACM DBLP
83
Design-to-time real-time scheduling
- Garvey, Lesser - 1993 ACM
82
Optimal composition of real-time systems
- Zilberstein, Russell - 1996 ACM DBLP
77
Provably bounded-optimal agents
- Russell, Subramanian - 1995 DBLP
66
A Course in Microeconomic Theory (context) - Kreps - 1990
65
Multiagent negotiation under time constraints
- Kraus, Wilkenfeld et al. - 1995 ACM DBLP
60
Negotiation among Self-Interested Computationally Limited Ag.. (context) - Sandholm - 1996 ACM
60
Models of bounded rationality (context) - Simon - 1982
55
Coalition formation among bounded rational agents
- Sandholm, Lesser - 1995 ACM DBLP
45
Games and Information (context) - Rasmusen - 1989
38
Equilibrium analysis of the possibilities of unenforced exch..
- Sandholm, Lesser - 1995 DBLP
38
A survey of research in deliberative real-time artificial in..
- Garvey, Lesser - 1994 ACM DBLP
36
A language and protocol to support intelligent agent interop.. (context) - Finin, Fritzson et al. - 1992
32
Forming coalitions in the face of uncertain rewards
- Ketchpel - 1994 ACM DBLP
32
Theories of Coalition Formation (context) - Kahan, Rapoport - 1984
32
Cooperative distributed problem solving (context) - Durfee, Lesser et al. - 1989 ACM
31
Task allocation via coalition formation among autonomous age..
- Shehory, Kraus - 1995 DBLP
30
Monitoring the progress of anytime problemsolving
- Hansen, Zilberstein - 1996
30
Twenty-seven principles of rationality (context) - Good - 1971
28
A kernel-oriented model for coalition-formation in general e..
- Shehory, Kraus - 1996
27
the National Academy of Sciences (context) - Nash, in et al. - 1950
26
the gains and losses of speculation in equilibrium markets
- Sandholm, Ygge - 1997
25
A model for cooperative transportation scheduling
- Fischer, Muller et al. - 1995
24
On complexity as bounded rationality (context) - Papadimitriou, Yannakakis - 1994
23
cryptography and stability: Mechanisms for coalition formati.. (context) - Zlotkin, Rosenschein - 1994
21
Self-fulfilling bias in multiagent learning
- Hu, Wellman - 1996
21
Naval Research Logistics Quarterly (context) - Shapley, sets - 1967
20
Coalition-proof Nash equilibria: I concepts (context) - Bernheim, Peleg et al. - 1987
20
Acceptable points in general cooperative n-person games (context) - Aumann - 1959
17
Spieltheoretische behandlung eines oligopolmodells mit nachf.. (context) - Selten - 1965
12
Utility-based termination of anytime algorithms (context) - Sandholm, Lesser - 1994 ACM
11
Telescript technology: The foundation for the electronic mar.. (context) - Magic - 1994
6
and Operations Res (context) - Charnes, Kortanek et al. - 1966
6
A strategy for decreasing the total transportation costs amo.. (context) - Sandholm - 1991
6
Electronic enterprises: Looking to the future (context) - Technology - 1994
5
An effective heuristic procedure for the traveling salesman .. (context) - Lin, Kernighan - 1971
5
Coalition formation processes with belief revision among bou.. (context) - Tohm'e, Sandholm - 1997
5
Coalition-proof Nash equilibria: II applications (context) - Bernheim, Whinston - 1987
5
the nucleolus of the basic vehicle routing game (context) - Lundgren, Jornsten et al. - 1992
4
Coalition formation: A game-theoretic approach (context) - van der Linden, Verbeek - 1985
3
AddisonWesley Publishing Company (context) - Kalakota, Whinston et al. - 1996
3
An information processing approach to small group interactio.. (context) - Friend - 1973
3
Paradoxes of Rationality: Theory of Metagames and Political .. (context) - Howard - 1971
2
University of Chicago Press (context) - Cook, Levi et al. - 1990
2
Automatic cooperation of area-distributed dispatch centers i.. (context) - Sandholm - 1992
1
A bargaining network for intelligent agents (context) - Sandholm - 1992
1
Advanced computer supported vehicle routing for heavy transp.. (context) - Linnainmaa, Jokinen et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.wustl.edu/~mas/publications.html): More
What should be minimized in a decision tree: A re-examination - Berkman, Sandholm (1995)
(Correct)
Contract Types for Satisficing Task Allocation: I Theoretical.. - Sandholm (1998)
(Correct)
An Implementation of the Contract Net Protocol Based on Marginal .. - Sandholm (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC