Sciweavers

3780 search results - page 37 / 756
» Algorithms for Game Metrics
Sort
View
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
13 years 9 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
SODA
2010
ACM
145views Algorithms» more  SODA 2010»
13 years 7 months ago
On the Equilibria of Alternating Move Games
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
WADS
2009
Springer
237views Algorithms» more  WADS 2009»
14 years 3 months ago
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
Daniel M. Kane, Gregory N. Price, Erik D. Demaine
ICOIN
2001
Springer
14 years 1 months ago
Performance Analysis of QoS Routing with Network Dependant Delay Cost
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
Hahnearl Jeon, Sung-Dae Kim, Young Joon Kim, Hyung...
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
14 years 2 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket