Three selfish spanning tree games
Year of publication: |
2008
|
---|---|
Authors: | Gourvès, Laurent ; Monnot, Jérôme |
Published in: |
Internet and network economics : 4th international workshop, WINE 2008, Shanghai, China, December 17-20, 2008 ; proceedings. - Berlin : Springer, ISBN 3-540-92184-2. - 2008, p. 465-476
|
Subject: | price of anarchy | Computernetz | Computer network | Spieltheorie | Game theory | Graphentheorie | Graph theory | Gleichgewichtsmodell | Equilibrium model | Theorie | Theory |
-
Khoury, Joud, (2009)
-
Approximate pure Nash equilibria via Lovász local lemma
Nguyen, Thanh, (2009)
-
Equilibrium computation in discrete network games
Leung, Michael P., (2020)
- More ...
-
On the performance of congestion games for optimum satisfiability problems
Giannakos, Aristotelis, (2007)
-
Selfish scheduling with setup times
Gourvès, Laurent, (2009)
-
On strong equilibria in the Max Cut game
Gourvès, Laurent, (2009)
- More ...