Sciweavers

3780 search results - page 6 / 756
» Algorithms for Game Metrics
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
ATAL
2010
Springer
13 years 8 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
JGAA
2007
123views more  JGAA 2007»
13 years 7 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
FLAIRS
2007
13 years 9 months ago
The Design and Implementation of a Successful General Game Playing Agent
General Game Playing is the problem of designing an agent capable of playing any previously unknown game when given only the rules. This paper describes the implementation archite...
David M. Kaiser