Alexander Skopalik

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Strategic Facility Location with Clients That Minimize Total Waiting Time.

[BibT_eX]

[DOI]

Simon Krogmann

Pascal Lenzner

Vipin Ravindran Vijayalakshmi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021

Two-Stage Facility Location Games with Strategic Clients and Facilities.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Hiring Secretaries over Time: The Benefit of Concurrent Employment.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

Improving Approximate Pure Nash Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019

Pure Nash equilibria in restricted budget games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Network Investment Game with Wardrop Followers.

[BibT_eX]

[DOI]

Daniel Schmand

Marc Schröder

CoRR, 2019

Network Investment Games with Wardrop Followers.

[BibT_eX]

[DOI]

Daniel Schmand

Marc Schröder

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Multi-Unit Bilateral Trade.

[BibT_eX]

[DOI]

Matthias Gerstgrasser

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Congestion games with mixed objectives.

[BibT_eX]

[DOI]

Lennart Leder

J. Comb. Optim., 2018

Disaggregating User Evaluations Using the Shapley Value.

[BibT_eX]

[DOI]

Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation, 2018

2017

Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.

[BibT_eX]

[DOI]

Proceedings of the Designing the Digital Transformation - 12th International Conference, 2017

Congestion Games with Complementarities.

[BibT_eX]

[DOI]

Lennart Leder

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Routing Games With Progressive Filling.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Strategic Online Facility Location.

[BibT_eX]

[DOI]

Maximilian Drees

Björn Feldkord

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

2014

Approximate Pure Nash Equilibria in Social Context Congestion Games.

[BibT_eX]

[DOI]

Martin Gairing

Grammateia Kotsialou

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.

[BibT_eX]

[DOI]

Martin Gairing

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Multilevel Network Games.

[BibT_eX]

[DOI]

Sebastian Abshoff

Andreas Cord-Landwehr

Daniel Jung

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A simulation framework for analyzing complex infinitely repeated games.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference On Simulation And Modeling Methodologies, 2014

Budget-Restricted Utility Games with Ordered Strategic Decisions.

[BibT_eX]

[DOI]

Maximilian Drees

Sören Riechers

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Approximate Pure Nash Equilibria in Weighted Congestion Games.

[BibT_eX]

[DOI]

Christoph Hansknecht

Max Klimm

Proceedings of the Approximation, 2014

2013

Altruism in Atomic Congestion Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2013

On the Complexity of Pareto-Optimal Nash and Strong Equilibria.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Computing pure Nash and strong equilibria in bottleneck congestion games.

[BibT_eX]

[DOI]

Math. Program., 2013

2012

Computing approximate pure Nash equilibria in congestion games.

[BibT_eX]

[DOI]

SIGecom Exch., 2012

Social Context in Potential Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

On the Impact of Fair Best Response Dynamics.

[BibT_eX]

[DOI]

Angelo Fanelli

Luca Moscardelli

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions

[BibT_eX]

[DOI]

CoRR, 2011

Efficient computation of approximate pure Nash equilibria

[BibT_eX]

[DOI]

CoRR, 2011

The Shapley Value as a Function of the Quota in Weighted Voting Games.

[BibT_eX]

[DOI]

Yair Zick

Edith Elkind

Proceedings of the IJCAI 2011, 2011

Considerate Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

On the complexity of equilibria in games with succinct representation.

[BibT_eX]

[DOI]

PhD thesis, 2010

2009

Stability and Convergence in Selfish Scheduling with Altruistic Agents.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the complexity of nash dynamics and sink equilibria.

[BibT_eX]

[DOI]

Vahab S. Mirrokni

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Doing Good with Spam Is Hard.

[BibT_eX]

[DOI]

Lars Olbrich

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008

Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.

[BibT_eX]

[DOI]

Heiner Ackermann

Internet Math., 2008

Altruism in Congestion Games

[BibT_eX]

[DOI]

CoRR, 2008

Taxing Subnetworks.

[BibT_eX]

[DOI]

Lars Olbrich

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Inapproximability of pure nash equilibria.

[BibT_eX]

[DOI]