5995 search results - page 426 / 1199 » Algorithmic Game Theory |
169
click to vote
JDA
2008
15 years 7 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
216
click to vote
ALGOSENSORS
2009
Springer
16 years 2 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
201
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
264
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
161
click to vote
ACCV
2009
Springer
16 years 2 months ago
2009
Springer
What are the primitives of visual perception? The early feature-analysis theory insists on it being a local-to-global process which has acted as the foundation of most computer vis...