• Publications
  • Influence
The computational difficulty of manipulating an election
We show how computational complexity might protect the integrity of social choice. We exhibit a voting rule that efficiently computes winners but is computationally resistant to strategicExpand
  • 520
  • 56
  • Open Access
Voting schemes for which it can be difficult to tell who won the election
We show that a voting scheme suggested by Lewis Carroll can be impractical in that it can be computationally prohibitive (specifically, NP-hard) to determine whether any particular candidate has wonExpand
  • 506
  • 49
Auction-Based Multi-Robot Routing
We propose a generic framework for auction-based multi-robot routing and analyze a variety of bidding rules for different team objectives. Expand
  • 281
  • 36
  • Open Access
A simplified NP-complete satisfiability problem
  • C. Tovey
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • 1 April 1984
3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. Expand
  • 337
  • 20
  • Open Access
Individual differences versus social dynamics in the formation of animal dominance hierarchies
Linear hierarchies, the classical pecking-order structures, are formed readily in both nature and the laboratory in a great range of species including humans. However, the probability of gettingExpand
  • 265
  • 17
  • Open Access
The Power of Sequential Single-Item Auctions for Agent Coordination
We analyzed a coordination system based on sequential single-item auctions, demonstrating that it combines the advantages of both. Expand
  • 109
  • 17
  • Open Access
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D
The shortest paths formed by the edges of 8-neighbor 2D grids can be up to ≈ 8% longer than the shortest paths in the continuous environment, which highlights the need for smart path planning algorithms in 3D. Expand
  • 92
  • 16
  • Open Access
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers
We propose a new decentralized honey bee-mimicking server allocation algorithm which dynamically allocates servers to satisfy request loads. Expand
  • 275
  • 12
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
Local search with k-change neighborhoods is perhaps the oldest and most widely used heuristic method for the traveling salesman problem, yet almost no theoretical performance guarantees for it were previously known. Expand
  • 88
  • 11
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
This paper describes a predicate calculus in which graph problems can be solved in linear time on any recursively constructed graph, once its decomposition tree is known. Expand
  • 171
  • 9
  • Open Access