• Publications
  • Influence
Rules of Encounter - Designing Conventions for Automated Negotiation among Computers
TLDR
Interaction mechanisms: the negotiation problem in different domains attributes of negotiation mechanisms assumptions incentive compatibility. Expand
  • 812
  • 42
A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies
TLDR
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
  • 196
  • 24
  • PDF
On the complexity of achieving proportional representation
TLDR
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 assembly is large. Expand
  • 158
  • 22
  • PDF
Supporting Privacy in Decentralized Additive Reputation Systems
TLDR
We argue that supporting perfect privacy in decentralized reputation systems is impossible, but as an alternative present three probabilistic schemes that support partial privacy. Expand
  • 103
  • 16
  • PDF
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
  • 156
  • 12
  • PDF
Algorithms for the coalitional manipulation problem
TLDR
We investigate the problem of coalitional manipulation in elections, which is known to be hard in a variety of voting rules. Expand
  • 126
  • 10
  • PDF
Approximating power indices: theoretical and empirical analysis
TLDR
We suggest and analyze randomized methods to approximate power indices such as the Banzhaf power index and the Shapley–Shubik power index. Expand
  • 106
  • 10
  • PDF
Complexity of unweighted coalitional manipulation under some common voting rules
TLDR
We study the computational complexity of the unweighted coalitional manipulation problem (UCM) under several prominent voting rules. Expand
  • 109
  • 9
Convergence of iterative voting
TLDR
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. Expand
  • 62
  • 9
  • PDF
Ad Hoc Autonomous Agent Teams: Collaboration without Pre-Coordination
TLDR
As autonomous agents proliferate in the real world, both in software and robotic settings, they will increasingly need to band together for cooperative activities with previously unfamiliar teammates. Expand
  • 236
  • 8
  • PDF
...
1
2
3
4
5
...