Share This Author
Rules of Encounter - Designing Conventions for Automated Negotiation among Computers
This chapter discusses the negotiation problem in different domains attributes of negotiation mechanisms assumptions incentive compatibility, and the hierarchy of deal types - summary unbounded worth of a goal - tidy agents.
On the complexity of achieving proportional representation
It is demonstrated that winner selection in two prominent proportional representation voting systems is a computationally intractable problem—implying that these systems are impractical when the assembly is large, and in settings where the size of the Assembly is constant, the problem can be solved in polynomial time.
A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies
This paper first enumerates trust research objectives to be addressed in the testbed and desirable testbed characteristics, then presents a competition testbed specification that is justified according to these requirements.
Coalition, Cryptography, and Stability: Mechanisms for Coalition Formation in Task Oriented Domains
A simple coalition formation mechanism that uses cryptographic techniques for subadditive Task Oriented Domains that is efficient, symmetric, and individual rational and satisfies coalition rationality.
Supporting Privacy in Decentralized Additive Reputation Systems
It is argued that supporting perfect privacy in decentralized reputation systems is impossible, but three probabilistic schemes that support partial privacy are presented that allow ratings to be privately provided with high probability in decentralized additive reputation systems.
Exploiting Problem Symmetries in State-Based Planners
This work evaluates its approach to symmetry exploitation on instances from previous planning competitions, and demonstrates that its algorithms significantly improve the solution time of instances with symmetries.
Ad Hoc Autonomous Agent Teams: Collaboration without Pre-Coordination
- P. Stone, G. Kaminka, Sarit Kraus, J. Rosenschein
- BusinessAAAI Conference on Artificial Intelligence
- 5 July 2010
This paper defines the concept of ad hoc team agents, specifies an evaluation paradigm, and provides examples of possible theoretical and empirical approaches to challenge to encourage progress towards this ambitious, newly realistic, and increasingly important research goal.
Junta distributions and the average-case complexity of manipulating elections
It is demonstrated that NP-hard manipulations may be tractable in the average-case, and a family of important voting protocols is susceptible to manipulation by coalitions, when the number of candidates is constant.
Algorithms for the coalitional manipulation problem
Research Directions for Service-Oriented Multiagent Systems
A 15-year roadmap for service-oriented multiagent system research is described, which states that further advances in multiagent systems could feed into tomorrow's successful service- oriented computing approaches.