-
1
-
-
84920156702
-
Complexity of pure Nash equilibria in player-specific network congestion games
-
H. Ackermann and A. Skopalik. Complexity of pure Nash equilibria in player-specific network congestion games. Internet Mathematics, 5(4):321-515, 2008.
-
(2008)
Internet Mathematics
, vol.5
, Issue.4
, pp. 321-515
-
-
Ackermann, H.1
Skopalik, A.2
-
2
-
-
81255191709
-
Exact price of anarchy for polynomial congestion games
-
S. Aland, D. Dumrauf, M. Gairing, B. Monien, and F. Schoppmann. Exact price of anarchy for polynomial congestion games. SIAM J. Comput., 40(5):1211-1233, 2011.
-
(2011)
SIAM J. Comput.
, vol.40
, Issue.5
, pp. 1211-1233
-
-
Aland, S.1
Dumrauf, D.2
Gairing, M.3
Monien, B.4
Schoppmann, F.5
-
3
-
-
67651019516
-
The price of stability for network design with fair cost allocation
-
E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. SIAM J. Comput., 38(4):1602-1623, 2008.
-
(2008)
SIAM J. Comput.
, vol.38
, Issue.4
, pp. 1602-1623
-
-
Anshelevich, E.1
Dasgupta, A.2
Kleinberg, J.3
Tardos, E.4
Wexler, T.5
Roughgarden, T.6
-
4
-
-
84906761682
-
Synthesis from component libraries with costs
-
LNCS 8704, Springer
-
G. Avni and O. Kupferman. Synthesis from component libraries with costs. In Proc. 25th CONCUR, LNCS 8704, pages 156-172. Springer, 2014.
-
(2014)
Proc. 25th CONCUR
, pp. 156-172
-
-
Avni, G.1
Kupferman, O.2
-
5
-
-
84900533068
-
Network-formation games with regular objectives
-
LNCS 8412, Springer
-
G. Avni, O. Kupferman, and T. Tamir. Network-formation games with regular objectives. In Proc. 17th FoSSaCS, LNCS 8412, pages 119-133. Springer, 2014.
-
(2014)
Proc. 17th FoSSaCS
, pp. 119-133
-
-
Avni, G.1
Kupferman, O.2
Tamir, T.3
-
6
-
-
84876226220
-
The price of routing unsplittable flow
-
B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. SIAM J. Comput., 42(1):160-177, 2013.
-
(2013)
SIAM J. Comput.
, vol.42
, Issue.1
, pp. 160-177
-
-
Awerbuch, B.1
Azar, Y.2
Epstein, A.3
-
7
-
-
84899863867
-
Leader-follower strategies for robotic patrolling in environments with arbitrary topologies
-
N. Basilico, N. Gatti, and F. Amigoni. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In Proc. 8th AAMAS, 2009.
-
(2009)
Proc. 8th AAMAS
-
-
Basilico, N.1
Gatti, N.2
Amigoni, F.3
-
8
-
-
78349250234
-
Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness
-
K. Bhawalkar, M. Gairing, and T. Roughgarden. Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness. In ESA (2), pages 17-28, 2010.
-
(2010)
ESA
, Issue.2
, pp. 17-28
-
-
Bhawalkar, K.1
Gairing, M.2
Roughgarden, T.3
-
9
-
-
84880305216
-
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
-
V. Bilò. A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In WAOA, pages 215-228, 2012.
-
(2012)
WAOA
, pp. 215-228
-
-
Bilò, V.1
-
10
-
-
80052861318
-
Tight bounds for selfish and greedy load balancing
-
I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, 61(3):606-637, 2011.
-
(2011)
Algorithmica
, vol.61
, Issue.3
, pp. 606-637
-
-
Caragiannis, I.1
Flammini, M.2
Kaklamanis, C.3
Kanellopoulos, P.4
Moscardelli, L.5
-
11
-
-
84880266577
-
Price of stability in polynomial congestion games
-
G. Christodoulou and M. Gairing. Price of stability in polynomial congestion games. In Proc. 40th ICALP, pages 496-507, 2013.
-
(2013)
Proc. 40th ICALP
, pp. 496-507
-
-
Christodoulou, G.1
Gairing, M.2
-
12
-
-
27144535939
-
On the price of anarchy and stability of correlated equilibria of linear congestion games
-
G. Christodoulou and E. Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games. In ESA, pages 59-70, 2005.
-
(2005)
ESA
, pp. 59-70
-
-
Christodoulou, G.1
Koutsoupias, E.2
-
13
-
-
35048902648
-
Improved automata generation for linear temporal logic
-
LNCS 1633, Springer
-
N. Daniele, F. Guinchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In Proc. 11th CAV, LNCS 1633, pages 249-260. Springer, 1999.
-
(1999)
Proc. 11th CAV
, pp. 249-260
-
-
Daniele, N.1
Guinchiglia, F.2
Vardi, M.Y.3
-
14
-
-
61449248100
-
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
-
J. Dunkel and A.S. Schulz. On the complexity of pure-strategy nash equilibria in congestion and local-effect games. Mathematics of Operations Research, 33(4):851-868, 2008.
-
(2008)
Mathematics of Operations Research
, vol.33
, Issue.4
, pp. 851-868
-
-
Dunkel, J.1
Schulz, A.S.2
-
15
-
-
0001126172
-
Pricing via processing, or, combatting junk mail
-
C. Dwork and M. Naor. Pricing via processing, or, combatting junk mail. In Proc. CRYPTO, pages 139-177, 2009.
-
(2009)
Proc. CRYPTO
, pp. 139-177
-
-
Dwork, C.1
Naor, M.2
-
17
-
-
33644558696
-
Selfish unsplittable flows
-
D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. Theoretical Computer Science, 348(2-3):226-239, 2005.
-
(2005)
Theoretical Computer Science
, vol.348
, Issue.2-3
, pp. 226-239
-
-
Fotakis, D.1
Kontogiannis, S.2
Spirakis, P.3
-
18
-
-
33745623166
-
Symmetry in network congestion games: Pure equilibria and anarchy cost
-
D. Fotakis, S. Kontogiannis, and P. Spirakis. Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In Proc. WAOA, pages 161-175, 2005.
-
(2005)
Proc. WAOA
, pp. 161-175
-
-
Fotakis, D.1
Kontogiannis, S.2
Spirakis, P.3
-
21
-
-
84866716218
-
On the existence of pure Nash equilibria in weighted congestion games
-
T. Harks and M. Klimm. On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res., 37(3):419-436, 2012.
-
(2012)
Math. Oper. Res.
, vol.37
, Issue.3
, pp. 419-436
-
-
Harks, T.1
Klimm, M.2
-
23
-
-
84884593028
-
Synthesis from component libraries
-
Y. Lustig and M.Y. Vardi. Synthesis from component libraries. STTT, 15(5-6):603-618, 2013.
-
(2013)
STTT
, vol.15
, Issue.5-6
, pp. 603-618
-
-
Lustig, Y.1
Vardi, M.Y.2
-
25
-
-
0030095543
-
Congestion games with player-specific payoff functions
-
I. Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13(1):111-124, 1996.
-
(1996)
Games and Economic Behavior
, vol.13
, Issue.1
, pp. 111-124
-
-
Milchtaich, I.1
-
26
-
-
0024864157
-
On the synthesis of a reactive module
-
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, pages 179-190, 1989.
-
(1989)
POPL
, pp. 179-190
-
-
Pnueli, A.1
Rosner, R.2
-
28
-
-
34250442766
-
A class of games possessing pure-strategy Nash equilibria
-
R.W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
-
(1973)
International Journal of Game Theory
, vol.2
, pp. 65-67
-
-
Rosenthal, R.W.1
-
29
-
-
0038183237
-
How bad is selfish routing?
-
T. Roughgarden and E. Tardos. How bad is selfish routing? JACM, 49(2):236-259, 2002.
-
(2002)
JACM
, vol.49
, Issue.2
, pp. 236-259
-
-
Roughgarden, T.1
Tardos, E.2
-
30
-
-
80054013671
-
On the existence of pure strategy nash equilibria in integer-splittable weighted congestion games
-
L. Tran-Thanh, M. Polukarov, A. C. Chapman, A. Rogers, and N. R. Jennings. On the existence of pure strategy nash equilibria in integer-splittable weighted congestion games. In SAGT, pages 236-253, 2011.
-
(2011)
SAGT
, pp. 236-253
-
-
Tran-Thanh, L.1
Polukarov, M.2
Chapman, A.C.3
Rogers, A.4
Jennings, N.R.5
|