Alexander Skopalik

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Playing snake on a graph2026-07-10Paper
Social welfare in battery charging games2026-02-27Paper
Improving approximate pure Nash equilibria in congestion games
(available as arXiv preprint)
2023-03-21Paper
Network investment games with Wardrop followers
(available as arXiv preprint)
2022-07-21Paper
Hiring secretaries over time: the benefit of concurrent employment
Mathematics of Operations Research
2020-04-30Paper
Pure Nash equilibria in restricted budget games
Journal of Combinatorial Optimization
2019-06-06Paper
Computing approximate pure Nash equilibria in Shapley value weighted congestion games
Web and Internet Economics
2019-01-30Paper
Congestion games with mixed objectives
Journal of Combinatorial Optimization
2018-12-06Paper
Pure Nash equilibria in restricted budget games
Lecture Notes in Computer Science
2017-10-23Paper
Congestion games with complementarities
Lecture Notes in Computer Science
2017-07-21Paper
Approximate pure Nash equilibria in weighted congestion games2017-03-22Paper
Strategic online facility location
Combinatorial Optimization and Applications
2017-02-01Paper
Congestion Games with Mixed Objectives
Combinatorial Optimization and Applications
2017-02-01Paper
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
Algorithmic Game Theory
2015-11-04Paper
Budget-restricted utility games with ordered strategic decisions
Algorithmic Game Theory
2015-01-14Paper
Multilevel network games
Web and Internet Economics
2015-01-07Paper
Approximate Pure Nash Equilibria in Social Context Congestion Games
Web and Internet Economics
2015-01-07Paper
Bounding the potential function in congestion games and approximate pure Nash equilibria
Web and Internet Economics
2015-01-07Paper
Efficient computation of approximate pure Nash equilibria in congestion games
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
2014-07-30Paper
Computing pure Nash and strong equilibria in bottleneck congestion games
Mathematical Programming. Series A. Series B
2013-11-11Paper
On the complexity of Pareto-optimal Nash and strong equilibria
Theory of Computing Systems
2013-10-21Paper
On the impact of fair best response dynamics
Mathematical Foundations of Computer Science 2012
2012-09-25Paper
On the complexity of Pareto-optimal Nash and strong equilibria
Algorithmic Game Theory
2010-10-19Paper
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Algorithms – ESA 2010
2010-09-06Paper
Complexity of pure Nash equilibria in player-specific network congestion games
Internet Mathematics
2010-07-09Paper
Doing good with spam is hard
Algorithmic Game Theory
2009-12-01Paper
Altruism in Atomic Congestion Games
Lecture Notes in Computer Science
2009-10-29Paper
scientific article; zbMATH DE number 5485547 (Why is no real title available?)2009-01-05Paper


Research outcomes over time


This page was built for person: Alexander Skopalik