| Alternate document: Details Coalition Formation Processes with Belief Revision among Bounded-Rational Self-Interested Agents (99) Fernando Tohme, Tuomas Sandholm |
Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé  Home/Search
Context Related
| 128.252.165.44/~sa...coalstruct.aij.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.252.165.44/~sandholm/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, finding the optimal coalition structure is NP-complete. But then, can the coalition structure found via a partial search be guaranteed to be within a bound from optimum? We show that none of the previous coalition structure... (Update)
Cited by: More
Role of acquaintance models in agent's private and.. - Pechoucek, Marik, Barta (2006) (Correct)
Complexity of Determining Nonemptiness of the Core - Vincent Conitzer And (2002) (Correct)
Complexity of Constructing Solutions in the Core Based on.. - Conitzer, Sandholm (2006) (Correct)
Similar documents (at the sentence level): More
76.0%: Coalition Structure Generation with Worst Case Guarantees - Sandholm, Larson.. (1999) (Correct)
23.4%: Anytime Coalition Structure Generation with Worst.. - Sandholm, Larson.. (1998) (Correct)
22.3%: Worst-Case-Optimal Anytime Coalition Structure Generation - Ti On (Correct)
Active bibliography (related documents): More All
1.2: Algorithm for Optimal Winner Determination in Combinatorial.. - Sandholm (2002) (Correct)
0.6: Coalition Formation among Bounded Rational Agents - Sandholm, Lesser (1995) (Correct)
0.4: Coalition Formation among Strong Autonomous and Weak.. - Guillaume Vauvert And (2001) (Correct)
Similar documents based on text: More All
0.4: Using Performance Profile Trees to Improve Deliberation Control - Larson, Sandholm (2004) (Correct)
0.4: Strategic Deliberation and Truthful Revelation: - An Impossibility Result (Correct)
0.4: Coalition Formation Processes with Belief Revision among.. - Tohme, Sandholm (1999) (Correct)
Related documents from co-citation: More All
19: Methods for task allocation via agent coalition formation - Shehory, Kraus - 1998
9: Coalitions among Computationally Bounded Agents - Sandholm, Lesser
7: Theories of Coalition Formation (context) - Kahan, Rapoport - 1984
BibTeX entry: (Update)
T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohme. Coalition structure generation with worst case guarantees. Artificial Intelligence Journal, 1999. http://citeseer.ist.psu.edu/sandholm99coalition.html More
@article{ sandholm99coalition,
author = "Tuomas Sandholm and Kate Larson and Martin Andersson and Onn Shehory and Fernando Tohme",
title = "Coalition Structure Generation with Worst Case Guarantees",
journal = "Artificial Intelligence",
volume = "111",
number = "1-2",
pages = "209-238",
year = "1999",
url = "citeseer.ist.psu.edu/sandholm99coalition.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
773 Reducibility among combinatorial problems (context) - Karp - 1972
318 Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1997
243 Rules of Encounter: Designing Conventions for Automated Nego.. (context) - Rosenschein, Zlotkin - 1994
184 An algorithm for optimal winner determination in combinatori.. - Sandholm - 1999
184 Computationally manageable combinatorial auctions - Rothkopf, Peke et al. - 1998
177 An implementation of the contract net protocol based on marg.. - Sandholm - 1993
157 Advanced Combinatorics (context) - Comtet - 1974
124 The Art and Science of Negotiation (context) - Raiffa - 1982
114 Oxford University Press (context) - Mas-Colell, Whinston et al. - 1995
89 Deliberation scheduling for problem solving in time-constrai.. (context) - Boddy, Dean - 1994
84 Advantages of a leveled commitment contracting protocol - Sandholm, Lesser - 1996
83 Design-to-time real-time scheduling - Garvey, Lesser - 1993
82 Optimal composition of real-time systems - Zilberstein, Russell - 1996
74 Perfect equilibrium in a bargaining model (context) - Rubinstein - 1982
63 person games (context) - Shapley, for - 1953
61 Methods for task allocation via agent coalition formation - Shehory, Kraus - 1998
60 Negotiation among self-interested computationally limited ag.. (context) - Sandholm - 1996
55 Coalition formation among bounded rational agents - Sandholm, Lesser - 1995
32 Forming coalitions in the face of uncertain rewards - Ketchpel - 1994
32 Theories of Coalition Formation (context) - Kahan, Rapoport - 1984
31 Task allocation via coalition formation among autonomous age.. - Shehory, Kraus - 1995
28 A kernel-oriented model for coalition-formation in general e.. - Shehory, Kraus - 1996
27 National Academy of Sciences (context) - Nash, in et al. - 1950
23 cryptography and stability: Mechanisms for coalition formati.. (context) - Zlotkin, Rosenschein - 1994
20 Coalition-proof Nash equilibria: I concepts (context) - Bernheim, Peleg et al. - 1987
18 A noncooperative theory of coalitional bargaining (context) - Chatterjee, Dutta et al. - 1993
13 Anytime coalition structure generation with worst case guara.. - Sandholm, Larson et al. - 1998
11 Greedy local search and weighted set packing approximation (context) - Chandra, Halldrsson - 1999
10 Efficient bounds for the stable set (context) - Hochbaum - 1983
9 Coalitional bargaining with competition to make offers (context) - Evans - 1997
8 A dynamic theory for the class of games with nonempty cores (context) - Wu - 1977
7 Anytime coalition structure generation: An average case stud.. (context) - Larson, Sandholm - 1999
6 Special issue on Electronic Commerce (context) - Sandholm, transactions et al. - 1997
6 Convergent transfer schemes for n-person games (context) - Stearns - 1968
5 Coalition-proof Nash equilibria: II applications (context) - Bernheim, Whinston - 1987
5 the nucleolus of the basic vehicle routing game (context) - Lundgren, Jrnsten et al. - 1992
4 Coalition formation: A game-theoretic approach (context) - van der Linden, Verbeek - 1985
4 Games computers play: Game-theoretic aspects of computing - Linial - 1992
3 and the complexity of economic organization (context) - DeVany, bounded - 1996
3 An information processing approach to small group interactio.. (context) - Friend - 1973
3 Clique is hard to approximate within n (context) - Hstad - 1996
2 Approximations of independent sets in graphs (context) - Halldrsson - 1998
2 The Nakamura theorem for coalition structures of quota games (context) - Deb, Weber et al. - 1996
2 Low-degree graph partitioning via local search with applicat.. - Halldrsson, Lau - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.252.165.44/~sandholm/): More
Coalitions among Computationally Bounded Agents - Sandholm, Lesser (Correct)
eMediator: a Next Generation Electronic Commerce Server - Sandholm (1999) (Correct)
An Algorithm for Optimal Winner Determination in Combinatorial.. - Sandholm (1999) (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