Alexander Skopalik

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 31

Top Venues

RWTH Aachen University (PHD)

Education History

RWTH Aachen University

PHD

Publications

Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos
Equilibria in Two-Stage Facility Location with Atomic Clients. CoRR (2024)
Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner, Alexander Skopalik
Strategic Resource Selection with Homophilic Agents. IJCAI (2023)
Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner, Alexander Skopalik
Strategic Resource Selection with Homophilic Agents. CoRR (2023)
Simon Krogmann, Pascal Lenzner, Alexander Skopalik
Strategic Facility Location with Clients That Minimize Total Waiting Time. AAAI (2023)
Simon Krogmann, Pascal Lenzner, Alexander Skopalik
Strategic Facility Location with Clients that Minimize Total Waiting Time. CoRR (2022)
Simon Krogmann, Pascal Lenzner, Louise Molitor, Alexander Skopalik
Two-Stage Facility Location Games with Strategic Clients and Facilities. IJCAI (2021)
Simon Krogmann, Pascal Lenzner, Louise Molitor, Alexander Skopalik
Two-Stage Facility Location Games with Strategic Clients and Facilities. CoRR (2021)
Vipin Ravindran Vijayalakshmi, Alexander Skopalik
Improving Approximate Pure Nash Equilibria in Congestion Games. WINE (2020)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45 (1) (2020)
Alexander Skopalik, Vipin Ravindran Vijayalakshmi
Improving approximate pure Nash equilibria in congestion games. CoRR (2020)
Daniel Schmand, Marc Schröder, Alexander Skopalik
Network Investment Games with Wardrop Followers. ICALP (2019)
Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. CoRR (2019)
Daniel Schmand, Marc Schröder, Alexander Skopalik
Network Investment Game with Wardrop Followers. CoRR (2019)
Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. AAMAS (2019)
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37 (2) (2019)
Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik
Multi-Unit Bilateral Trade. AAAI (2019)
Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik
Multi-unit Bilateral Trade. CoRR (2018)
Matthias Feldotto, Claus-Jochen Haake, Alexander Skopalik, Nadja Stroh-Maraun
Disaggregating User Evaluations Using the Shapley Value. NetEcon@SIGMETRICS (2018)
Matthias Feldotto, Lennart Leder, Alexander Skopalik
Congestion games with mixed objectives. J. Comb. Optim. 36 (4) (2018)
Matthias Feldotto, Lennart Leder, Alexander Skopalik
Congestion Games with Complementarities. CoRR (2017)
Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. CoRR (2017)
Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. SPAA (2017)
Matthias Feldotto, Lennart Leder, Alexander Skopalik
Congestion Games with Complementarities. CIAC (2017)
Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. WINE (2017)
Matthias Feldotto, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, Alexander Skopalik
Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. DESRIST (2017)
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
Pure Nash Equilibria in Restricted Budget Games. COCOON (2017)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR (2016)
Maximilian Drees, Björn Feldkord, Alexander Skopalik
Strategic Online Facility Location. COCOA (2016)
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
Routing Games With Progressive Filling. IEEE/ACM Trans. Netw. 24 (4) (2016)
Matthias Feldotto, Lennart Leder, Alexander Skopalik
Congestion Games with Mixed Objectives. COCOA (2016)
Matthias Feldotto, Lennart Leder, Alexander Skopalik
Congestion Games with Mixed Objectives. CoRR (2016)
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. CoRR (2015)
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. SAGT (2015)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. ACM Trans. Economics and Comput. 3 (1) (2015)
Matthias Feldotto, Alexander Skopalik
A simulation framework for analyzing complex infinitely repeated games. SIMULTECH (2014)
Maximilian Drees, Sören Riechers, Alexander Skopalik
Budget-restricted utility games with ordered strategic decisions. CoRR (2014)
Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung, Alexander Skopalik
Multilevel Network Games. CoRR (2014)
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
Routing games with progressive filling. INFOCOM (2014)
Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung, Alexander Skopalik
Multilevel Network Games. WINE (2014)
Martin Gairing, Grammateia Kotsialou, Alexander Skopalik
Approximate Pure Nash Equilibria in Social Context Congestion Games. WINE (2014)
Maximilian Drees, Sören Riechers, Alexander Skopalik
Budget-Restricted Utility Games with Ordered Strategic Decisions. SAGT (2014)
Christoph Hansknecht, Max Klimm, Alexander Skopalik
Approximate Pure Nash Equilibria in Weighted Congestion Games. APPROX-RANDOM (2014)
Matthias Feldotto, Martin Gairing, Alexander Skopalik
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. WINE (2014)
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141 (1-2) (2013)
Martin Hoefer, Alexander Skopalik
Altruism in Atomic Congestion Games. ACM Trans. Economics and Comput. 1 (4) (2013)
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
Routing Games with Progressive Filling. CoRR (2013)
Martin Hoefer, Alexander Skopalik
On the Complexity of Pareto-Optimal Nash and Strong Equilibria. Theory Comput. Syst. 53 (3) (2013)
Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
On the Impact of Fair Best Response Dynamics. MFCS (2012)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Computing approximate pure Nash equilibria in congestion games. SIGecom Exch. 11 (1) (2012)
Martin Hoefer, Alexander Skopalik
Social Context in Potential Games. WINE (2012)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. EC (2012)
Yair Zick, Alexander Skopalik, Edith Elkind
The Shapley Value as a Function of the Quota in Weighted Voting Games. IJCAI (2011)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions CoRR (2011)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Efficient computation of approximate pure Nash equilibria CoRR (2011)
Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
Considerate Equilibrium. IJCAI (2011)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS (2011)
Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
On the Impact of Fair Best Response Dynamics CoRR (2011)
Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
Considerate Equilibrium CoRR (2010)
Martin Hoefer, Alexander Skopalik
On the Complexity of Pareto-optimal Nash and Strong Equilibria. SAGT (2010)
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. ESA (2) (2010)
Martin Hoefer, Lars Olbrich, Alexander Skopalik
Doing Good with Spam Is Hard. SAGT (2009)
Martin Hoefer, Alexander Skopalik
Stability and Convergence in Selfish Scheduling with Altruistic Agents. WINE (2009)
Martin Hoefer, Alexander Skopalik
Altruism in Atomic Congestion Games. ESA (2009)
Vahab S. Mirrokni, Alexander Skopalik
On the complexity of nash dynamics and sink equilibria. EC (2009)
Vahab S. Mirrokni, Alexander Skopalik
On the complexity of Nash dynamics and Sink Equilibria CoRR (2009)
Alexander Skopalik, Berthold Vöcking
Inapproximability of pure nash equilibria. STOC (2008)
Martin Hoefer, Lars Olbrich, Alexander Skopalik
Taxing Subnetworks. WINE (2008)
Heiner Ackermann, Alexander Skopalik
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. Internet Math. 5 (4) (2008)
Martin Hoefer, Alexander Skopalik
Altruism in Congestion Games CoRR (2008)
Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik
Fast convergence to nearly optimal solutions in potential games. EC (2008)
Heiner Ackermann, Alexander Skopalik
On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. WINE (2007)

Alexander Skopalik.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexander Skopalik