- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j2 |      | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Computing approximate pure Nash equilibria in congestion games. SIGecom Exchanges 11(1): 26-29 (2012) |
| c16 | | Angelo Fanelli, Luca Moscardelli, Alexander Skopalik: On the Impact of Fair Best Response Dynamics. MFCS 2012: 360-371 |
| c15 | | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Conference on Electronic Commerce 2012: 284-301 |
| c14 | | |
| 2011 | ||
| c13 | | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS 2011: 532-541 |
| c12 | | Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking: Considerate Equilibrium. IJCAI 2011: 234-239 |
| c11 | | Yair Zick, Alexander Skopalik, Edith Elkind: The Shapley Value as a Function of the Quota in Weighted Voting Games. IJCAI 2011: 490-496 |
| i6 | | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Efficient computation of approximate pure Nash equilibria. CoRR abs/1104.2690 (2011) |
| i5 | | Angelo Fanelli, Luca Moscardelli, Alexander Skopalik: On the Impact of Fair Best Response Dynamics. CoRR abs/1104.5642 (2011) |
| i4 | | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik: Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions. CoRR abs/1107.2248 (2011) |
| 2010 | ||
| b1 | | Alexander Skopalik: On the complexity of equilibria in games with succinct representation. RWTH Aachen University 2010 |
| c10 | | Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik: Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. ESA (2) 2010: 29-38 |
| c9 | | Martin Hoefer, Alexander Skopalik: On the Complexity of Pareto-optimal Nash and Strong Equilibria. SAGT 2010: 312-322 |
| i3 | | Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking: Considerate Equilibrium. CoRR abs/1012.1547 (2010) |
| 2009 | ||
| c8 | | |
| c7 | | |
| c6 | | Vahab S. Mirrokni, Alexander Skopalik: On the complexity of nash dynamics and sink equilibria. ACM Conference on Electronic Commerce 2009: 1-10 |
| c5 | | Martin Hoefer, Alexander Skopalik: Stability and Convergence in Selfish Scheduling with Altruistic Agents. WINE 2009: 616-622 |
| i2 | | Vahab S. Mirrokni, Alexander Skopalik: On the complexity of Nash dynamics and Sink Equilibria. CoRR abs/0902.0382 (2009) |
| 2008 | ||
| j1 | | Heiner Ackermann, Alexander Skopalik: Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. Internet Mathematics 5(4): 323-342 (2008) |
| c4 | | Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik: Fast convergence to nearly optimal solutions in potential games. ACM Conference on Electronic Commerce 2008: 264-273 |
| c3 | | |
| c2 | | |
| i1 | | |
| 2007 | ||
| c1 | | Heiner Ackermann, Alexander Skopalik: On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. WINE 2007: 419-430 |
Data released under the ODC-BY 1.0 license — See also our legal information page