default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Skopalik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i23]Simon Krogmann, Pascal Lenzner, Alexander Skopalik:
The Bakers and Millers Game with Restricted Locations. CoRR abs/2501.05334 (2025)- 2024
- [c40]Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos:
Equilibria in Two-Stage Facility Location with Atomic Clients. IJCAI 2024: 2842-2850 - [i22]Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos:
Equilibria in Two-Stage Facility Location with Atomic Clients. CoRR abs/2403.03114 (2024) - 2023
- [c39]Simon Krogmann
, Pascal Lenzner, Alexander Skopalik:
Strategic Facility Location with Clients That Minimize Total Waiting Time. AAAI 2023: 5714-5721 - [c38]Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner, Alexander Skopalik:
Strategic Resource Selection with Homophilic Agents. IJCAI 2023: 2701-2709 - [i21]Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner, Alexander Skopalik:
Strategic Resource Selection with Homophilic Agents. CoRR abs/2305.00843 (2023) - 2022
- [i20]Simon Krogmann, Pascal Lenzner, Alexander Skopalik:
Strategic Facility Location with Clients that Minimize Total Waiting Time. CoRR abs/2211.14016 (2022) - 2021
- [c37]Simon Krogmann, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
Two-Stage Facility Location Games with Strategic Clients and Facilities. IJCAI 2021: 292-298 - [i19]Simon Krogmann, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
Two-Stage Facility Location Games with Strategic Clients and Facilities. CoRR abs/2105.01425 (2021) - 2020
- [j10]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): 323-352 (2020) - [c36]Vipin Ravindran Vijayalakshmi, Alexander Skopalik:
Improving Approximate Pure Nash Equilibria in Congestion Games. WINE 2020: 280-294 - [i18]Alexander Skopalik, Vipin Ravindran Vijayalakshmi:
Improving approximate pure Nash equilibria in congestion games. CoRR abs/2007.15520 (2020)
2010 – 2019
- 2019
- [j9]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37(2): 620-638 (2019) - [c35]Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik:
Multi-Unit Bilateral Trade. AAAI 2019: 1973-1980 - [c34]Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. AAMAS 2019: 1949-1951 - [c33]Daniel Schmand, Marc Schröder, Alexander Skopalik:
Network Investment Games with Wardrop Followers. ICALP 2019: 151:1-151:14 - [i17]Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. CoRR abs/1903.04265 (2019) - [i16]Daniel Schmand, Marc Schröder, Alexander Skopalik:
Network Investment Game with Wardrop Followers. CoRR abs/1904.10417 (2019) - 2018
- [j8]Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion games with mixed objectives. J. Comb. Optim. 36(4): 1145-1167 (2018) - [c32]Matthias Feldotto, Claus-Jochen Haake, Alexander Skopalik, Nadja Stroh-Maraun:
Disaggregating User Evaluations Using the Shapley Value. NetEcon@SIGMETRICS 2018: 5:1-5:6 - [i15]Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik:
Multi-unit Bilateral Trade. CoRR abs/1811.05130 (2018) - 2017
- [c31]Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion Games with Complementarities. CIAC 2017: 222-233 - [c30]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash Equilibria in Restricted Budget Games. COCOON 2017: 175-187 - [c29]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: 462-467 - [c28]Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik:
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. SPAA 2017: 123-132 - [c27]Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. WINE 2017: 191-204 - [i14]Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion Games with Complementarities. CoRR abs/1701.07304 (2017) - [i13]Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. CoRR abs/1710.01634 (2017) - 2016
- [j7]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing Games With Progressive Filling. IEEE/ACM Trans. Netw. 24(4): 2553-2562 (2016) - [c26]Maximilian Drees, Björn Feldkord, Alexander Skopalik:
Strategic Online Facility Location. COCOA 2016: 593-607 - [c25]Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion Games with Mixed Objectives. COCOA 2016: 655-669 - [i12]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 abs/1604.08125 (2016) - [i11]Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion Games with Mixed Objectives. CoRR abs/1607.05143 (2016) - 2015
- [j6]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): 2:1-2:32 (2015) - [c24]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. SAGT 2015: 178-189 - [i10]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. CoRR abs/1507.02908 (2015) - 2014
- [c23]Christoph Hansknecht, Max Klimm, Alexander Skopalik:
Approximate Pure Nash Equilibria in Weighted Congestion Games. APPROX-RANDOM 2014: 242-257 - [c22]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing games with progressive filling. INFOCOM 2014: 352-360 - [c21]Maximilian Drees, Sören Riechers, Alexander Skopalik:
Budget-Restricted Utility Games with Ordered Strategic Decisions. SAGT 2014: 110-121 - [c20]Matthias Feldotto, Alexander Skopalik:
A simulation framework for analyzing complex infinitely repeated games. SIMULTECH 2014: 625-630 - [c19]Matthias Feldotto, Martin Gairing, Alexander Skopalik:
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. WINE 2014: 30-43 - [c18]Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung, Alexander Skopalik:
Multilevel Network Games. WINE 2014: 435-440 - [c17]Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Approximate Pure Nash Equilibria in Social Context Congestion Games. WINE 2014: 480-485 - [i9]Maximilian Drees, Sören Riechers, Alexander Skopalik:
Budget-restricted utility games with ordered strategic decisions. CoRR abs/1407.3123 (2014) - [i8]Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung, Alexander Skopalik:
Multilevel Network Games. CoRR abs/1409.5383 (2014) - 2013
- [j5]Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik:
Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141(1-2): 193-215 (2013) - [j4]Martin Hoefer, Alexander Skopalik:
On the Complexity of Pareto-Optimal Nash and Strong Equilibria. Theory Comput. Syst. 53(3): 441-453 (2013) - [j3]Martin Hoefer, Alexander Skopalik:
Altruism in Atomic Congestion Games. ACM Trans. Economics and Comput. 1(4): 21:1-21:21 (2013) - [i7]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing Games with Progressive Filling. CoRR abs/1308.3161 (2013) - 2012
- [j2]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Computing approximate pure Nash equilibria in congestion games. SIGecom Exch. 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. EC 2012: 284-301 - [c14]Martin Hoefer, Alexander Skopalik:
Social Context in Potential Games. WINE 2012: 364-377 - 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)
2000 – 2009
- 2009
- [c8]Martin Hoefer, Alexander Skopalik:
Altruism in Atomic Congestion Games. ESA 2009: 179-189 - [c7]Martin Hoefer, Lars Olbrich, Alexander Skopalik:
Doing Good with Spam Is Hard. SAGT 2009: 263-274 - [c6]Vahab S. Mirrokni, Alexander Skopalik:
On the complexity of nash dynamics and sink equilibria. EC 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 Math. 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. EC 2008: 264-273 - [c3]Alexander Skopalik, Berthold Vöcking:
Inapproximability of pure nash equilibria. STOC 2008: 355-364 - [c2]Martin Hoefer, Lars Olbrich, Alexander Skopalik:
Taxing Subnetworks. WINE 2008: 286-294 - [i1]Martin Hoefer, Alexander Skopalik:
Altruism in Congestion Games. CoRR abs/0807.2011 (2008) - 2007
- [c1]Heiner Ackermann, Alexander Skopalik:
On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. WINE 2007: 419-430
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 19:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
