Skip to search formSkip to main contentSkip to account menu

A survey of multi-agent organizational paradigms

A survey of the major organizational paradigms used in multi-agent systems, which include hierarchies, holarchies, coalitions, teams, congregations, societies, federations, markets, and matrix organizations are presented.
View on Cambridge Press (opens in a new tab)

Solving Transition Independent Decentralized Markov Decision Processes

This work presents a novel algorithm for solving a specific class of decentralized MDPs in which the agents' transitions are independent, and lays the foundation for further work in this area on both exact and approximate algorithms.
View via Publisher (opens in a new tab)

Coalitions Among Computationally Bounded Agents

View via Publisher (opens in a new tab)

Solving distributed constraint optimization problems using cooperative mediation

    R. MaillerV. Lesser
    Computer Science
    Proceedings of the Third International Joint…
  • 19 July 2004
An optimal, distributed algorithm called optimal asynchronous partial overlay (OptAPO) for solving DCOPs that is based on a partial centralization technique called cooperative mediation, and empirical evidence shows that OptAPO performs better than other known, optimal DCOP techniques.
View on ACM (opens in a new tab)

The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty

The characteristics of the speech problem in particular, the special kinds of problem-solving uncertainty in that domain, the structure of the Hearsay-II system developed to cope with that uncertainty, and the relationship between Hearsey-II's structure and those of other speech-understanding systems are discussed.
View on ACM (opens in a new tab)

Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework

A number of previously unaddressed issues that arise in automated negot/ation among self-interested agents whose rationality is bounded by computational complexity are discussed, and the implications of bounded rationality are analysed.

Designing a Family of Coordination Algorithms

This paper discusses the design and implementation of an extendable family of coordination mechanisms, called Generalized Partial Global Planning (GPGP), and shows how to decide if adding a new mechanism is useful, and a way to prune the search for an appropriate combination of mechanisms in an environment.

Evolution of the GPGP/TÆMS Domain-Independent Coordination Framework

This paper discusses the evolution of the GPGP/TÆMS domain-independent coordination framework for small agent groups, and presents new coordination mechanisms for use in resource sharing and contracting, and more complex coordination mechanisms that use a cooperative search among agents to find appropriate commitments.
View on ACM (opens in a new tab)

Environment Centered Analysis and Design of Coordination Mechanisms

The structure and characteristics of an environment can and should be used as the central guide to the design of coordination mechanisms, and thus must be a part of the eventual goal, a comprehensive theory of coordination, partially developed here.

Negotiation among self-interested computationally limited agents

This dissertation analyses negotiations among agents that try to maximize payoff without concern of the global good, where computational limitations restrict each agent's rationality: in combinatorial negotiation domains computational complexity precludes enumerating and evaluating all possible outcomes.
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)