Sciweavers

1447 search results - page 5 / 290
» Graphs and Path Equilibria
Sort
View
WG
2010
Springer
13 years 7 months ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
OSDI
2008
ACM
14 years 10 months ago
FlightPath: Obedience vs. Choice in Cooperative Services
: We present FlightPath, a novel peer-to-peer streaming application that provides a highly reliable data stream to a dynamic set of peers. We demonstrate that FlightPath reduces ji...
Harry C. Li, Allen Clement, Mirco Marchetti, Manos...
MST
2010
78views more  MST 2010»
13 years 8 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
UAI
2001
13 years 11 months ago
Graphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 9 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...