• Publications
  • Influence
Rules of Encounter - Designing Conventions for Automated Negotiation among Computers
Part 1 Machines that make deals: the premise machine encounters social engineering for machines scenarios how does this differ from Al? how does this differ from game theory? Part 2 InteractionExpand
  • 733
  • 37
A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies
A diverse collection of trust-modeling algorithms for multi-agent systems has been developed in recent years, resulting in significant breadth-wise growth without unified direction or benchmarks.Expand
  • 189
  • 23
On the complexity of achieving proportional representation
We demonstrate that winner selection in two prominent proportional representation voting systems is a computationally intractable problem—implying that these systems are impractical when the assemblyExpand
  • 149
  • 19
Supporting Privacy in Decentralized Additive Reputation Systems
Previous studies have been suggestive of the fact that reputation ratings may be provided in a strategic manner for reasons of reciprocation and retaliation, and therefore may not properly reflectExpand
  • 99
  • 15
Research Directions for Service-Oriented Multiagent Systems
Today's service-oriented systems realize many ideas from the research conducted a decade or so ago in multiagent systems. Because these two fields are so deeply connected, further advances inExpand
  • 154
  • 12
Deals Among Rational Agents
A formal framework is presented that models communication and promises in multi-agent interactions. This framework generalizes previous work on cooperation without communication, and shows theExpand
  • 262
  • 11
Algorithms for the coalitional manipulation problem
We investigate the problem of coalitional manipulation in elections, which is known to be hard in a variety of voting rules. We put forward efficient algorithms for the problem in Scoring rules,Expand
  • 121
  • 10
Convergence of iterative voting
In multiagent systems, social choice functions can help aggregate the distinct preferences that agents have over alternatives, enabling them to settle on a single choice. Despite the basicExpand
  • 61
  • 10
Designing Conventions for Automated Negotiation
■ As distributed systems of computers play an increasingly important role in society, it will be necessary to consider ways in which these machines can be made to interact effectively. We areExpand
  • 221
  • 9
Complexity of unweighted coalitional manipulation under some common voting rules
Understanding the computational complexity of manipulation in elections is arguably the most central agenda in Computational Social Choice. One of the influential variations of the the problemExpand
  • 107
  • 9