Ausgabe 1/2011
Special Issue: Algorithmic Game Theory
Inhalt (10 Artikel)
Performance of One-Round Walks in Linear Congestion Games
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Tobias Harks, Max Klimm, Rolf H. Möhring
The Computational Complexity of Weak Saddles
Felix Brandt, Markus Brill, Felix Fischer, Jan Hoffmann
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Felix Brandt, Markus Brill, Felix Fischer, Paul Harrenstein