Hauptinhalt

Alexander Skopalik

Address:		Informatik 2, Technische Universität Dortmund, D-44221 Dortmund, Germany
Office:		Campus Nord, Otto-Hahn-Straße 14, room 307
E-mail:		Alexander.Skopalik.tu-dortmund.de
Phone:		+49 (0)231 755-7729
Fax:		+49 (0)231 755-2047

---

Research Interests:

• algorithmic game theory
• complexity of equilibria and other solution concepts
• algorithm and complexity in cooperative games and social choice
• complexity of local search
• streaming algortihms

---

Publications

Preprints/ Working Papers

• On the Impact of Fair Best Response Dynamics
  Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
  

Publications

• Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions
  Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
  13th ACM Conference on Electronic Commerce, 2012
  


• Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
  Tobias Harks, Max Klimm, Martin Hoefer, Alexander Skopalik
  Mathematical Programming.


• Efficient computation of approximate pure Nash equilibria in congestion games
  Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
  52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2011
  


• The Shapley Value as a Function of the Quota in Weighted Voting Games
  Yair Zick, Alexander Skopalik, Edith Elkind
  22nd International Joint Conferences on Artificial Intelligence (IJCAI)
  
  
• Considerate Equilibrium
  Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
  22nd International Joint Conferences on Artificial Intelligence (IJCAI)
  
  
• On the Complexity of Pareto-optimal Nash and Strong Equilibria
  Martin Hoefer, Alexander Skopalik
  3rd International Symposium on Algorithmic Game Theory (SAGT)
  


• Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
  Tobias Harks, Max Klimm, Martin Hoefer, Alexander Skopalik
  18th Annual European Symposium on Algorithms (ESA)


• On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
  Heiner Ackermann, Alexander Skopalik
  Internet Mathematics, Volume 5, Number 4, Pages 323-342
  


• Stability and Convergence in Selfish Scheduling with Altruistic Agents
  Martin Hoefer, Alexander Skopalik
  5th Workshop on Internet and Network Economics (WINE)
  Rome, Italy, December 2009
  


• Doing Good with Spam is Hard
  Martin Hoefer, Lars Olbrich, and Alexander Skopalik.
  Symposium on Algorithmic Game Theory (SAGT),
  Paphos, Cyprus, October 2009
  


• Altruism in Congestion Games
  Martin Hoefer, Alexander Skopalik
  17th Annual European Symposium on Algorithms (ESA),
  Copenhagen, Denmark, 2009
  


• On the Complexity of Nash Dynamics and Sink Equilibria
  Vahab Mirrokni, Alexander Skopalik
  10th ACM Conference on Electronic Commerce (EC),
  Stanford, USA, 2009.
  


• Taxing Subnetworks
  Martin Hoefer, Lars Olbrich, and Alexander Skopalik.
  4th Workshop on Internet and Network Economics (WINE),
  Shanghai, China, December 2008
  


• Fast Convergence to Nearly Optimal Solutions in Potential Games
  Amir Epstein, Baruch Awerbuch, Yossi Azar, Vahab Mirrokni, Alexander Skopalik
  9th ACM Conferencee on Electronic Commerce (EC) Chicago, USA, 2008.
  


• Inapproximability of Pure Nash Equilibria
  Alexander Skopalik, Berthold Vöcking
  40th ACM Symposium on Theory of Computing (STOC) Victoria, Canada, 2008.
  


• On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
  Heiner Ackermann, Alexander Skopalik
  3rd International Workshop on Internet and Network Economics (WINE) San Diego, USA, 2007, p.419-430.
  
  

Misc

• Das Aachener Modell - ErstsemesterInnen-Arbeit an der RWTH Aachen
  Alexander Skopalik, Daniel Houben
  Trau' keinem über 30? Gelebte Hochschulutopien der TutorInnengruppe in Aachen zwischen 1974 und 2004
  

Teaching Assistance

• Spring 2011: Mathematical Foundations of Game Theory
• Summer 2007: Seminar Algorithmische Spieltheorie
• Winter 2007/2008: Berechenbarkeit und Komplexität
• Summer 2008: Software-Projektpraktikum Graphalgorithmen
• Winter 2008/2009: Berechenbarkeit und Komplexität
• Summer 2009: Seminar Algorithmische Kryptographie
• Winter 2009/2010: Berechenbarkeit und Komplexität