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