Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

TAMC
2010
Springer

favoriteEmaildiscussreport

248views Applied Computing» more TAMC 2010»

The Max k-Cut Game and Its Strong Equilibria

14 years 4 months ago

The Max k-Cut Game and Its Strong Equilibria

Download www.lamsade.dauphine.fr

An instance of the max k−cut game is an edge weighted graph. Every

Laurent Gourvès, Jérôme Monnot

Real-time Traffic

Edge Weighted Graph | TAMC 2010 |

claim paper

Related Content

» Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

» On Strong Equilibria in the Max Cut Game

» On Pure and approximate Strong Equilibria of Facility Location Games

» Metastable Equilibria

» Equilibria in topology control games for ad hoc networks

» Single timescale regularized stochastic approximation schemes for monotone Nash games unde...

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» Selfish Bin Packing

Post Info
More Details (n/a)

Added	11 Jul 2010
Updated	11 Jul 2010
Type	Conference
Year	2010
Where	TAMC
Authors	Laurent Gourvès, Jérôme Monnot

Comments (0)