19 search results - page 1 / 4 » Algorithms for Game Metrics (Full Version) |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
STOC
2004
ACM
14 years 9 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
WINE
2010
Springer
13 years 7 months ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...