Sciweavers

129 search results - page 19 / 26
» Games, geometry, and the computational complexity of finding...
Sort
View
108
Voted
ATAL
2010
Springer
15 years 1 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach
136
Voted
COMGEO
2006
ACM
15 years 15 days ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
104
Voted
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 3 days ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
99
Voted
SIGGRAPH
1990
ACM
15 years 4 months ago
Real-time robot motion planning using rasterizing computer graphics hardware
We presenta real-time robot motion plannerthatis fastandcomplete to a resolution. The technique is guaranteed to find a path if one exists at the resolution, and all paths returne...
Jed Lengyel, Mark Reichert, Bruce Randall Donald, ...
94
Voted
CHI
2005
ACM
16 years 25 days ago
Life on the edge: supporting collaboration in location-based experiences
We study a collaborative location-based game in which groups of `lions' hunt together on a virtual savannah that is overlaid on an open playing field. The game implements a s...
Steve Benford, Duncan Rowland, Martin Flintham, Ad...