C. Tovey

Publications
Influence

The computational difficulty of manipulating an election

J. J. Bartholdi, C. Tovey, M. Trick
Economics
1 July 1989

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 strategic… Expand

Voting schemes for which it can be difficult to tell who won the election

J. J. Bartholdi, C. Tovey, M. Trick
Economics
1 April 1989

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 won… Expand

Auction-Based Multi-Robot Routing

M. Lagoudakis, E. Markakis, +6 authors Sonal Jain
Computer Science
Robotics: Science and Systems
8 June 2005

We propose a generic framework for auction-based multi-robot routing and analyze a variety of bidding rules for different team objectives. Expand

A simplified NP-complete satisfiability problem

C. Tovey
Computer Science, Mathematics
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

Individual differences versus social dynamics in the formation of animal dominance hierarchies

Ivan D Chase, C. Tovey, Debra Spangler-Martin, M. Manfredonia
Biology, Medicine
Proceedings of the National Academy of Sciences…
16 April 2002

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 getting… Expand

The Power of Sequential Single-Item Auctions for Agent Coordination

Sven Koenig, C. Tovey, +6 authors Sonal Jain
Computer Science
AAAI
16 July 2006

We analyzed a coordination system based on sequential single-item auctions, demonstrating that it combines the advantages of both. Expand

Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D

A. Nash, Sven Koenig, C. Tovey
Computer Science, Mathematics
SOCS
11 July 2010

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

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem

B. Chandra, H. Karloff, C. Tovey
Mathematics, Computer Science
SIAM J. Comput.
1 August 1999

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

On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers

Sunil Nakrani, C. Tovey
Computer Science
Adapt. Behav.
1 September 2004

We propose a new decentralized honey bee-mimicking server allocation algorithm which dynamically allocates servers to satisfy request loads. Expand

The Generation of Bidding Rules for Auction-Based Robot Coordination

C. Tovey, M. Lagoudakis, Sonal Jain, Sven Koenig
Computer Science
2005

In this paper, we propose the first such method and demonstrate it by deriving bidding rules for three possible team objectives of a multi-robot exploration task. Expand

Recommended Authors