On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 162, doi. 10.1007/s00224-010-9282-7
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2011 AND VI 49 AND IP 1
Results: 10
1
2
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 196, doi. 10.1007/s00224-010-9281-8
- By:
- Publication type:
- Article
3
The Computational Complexity of Weak Saddles.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 139, doi. 10.1007/s00224-010-9298-z
- By:
- Publication type:
- Article
4
Nash Equilibria and the Price of Anarchy for Flows over Time.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 71, doi. 10.1007/s00224-010-9299-y
- By:
- Publication type:
- Article
5
Performance of One-Round Walks in Linear Congestion Games.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 24, doi. 10.1007/s00224-010-9309-0
- By:
- Publication type:
- Article
6
The Balloon Popping Problem Revisited: Lower and Upper Bounds.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 182, doi. 10.1007/s00224-011-9314-y
- By:
- Publication type:
- Article
7
Non-clairvoyant Scheduling Games.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 3, doi. 10.1007/s00224-011-9316-9
- By:
- Publication type:
- Article
8
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 46, doi. 10.1007/s00224-011-9315-x
- By:
- Publication type:
- Article
9
Price of Stability in Survivable Network Design.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 98, doi. 10.1007/s00224-011-9317-8
- By:
- Publication type:
- Article
10
Preface: Algorithmic Game Theory.
- Published in:
- 2011
- By:
- Publication type:
- Editorial