16 citations · 29 across the 19 of their papers we have counts for
4 papers · 1 filter
Condorcet Dimension and Pareto Optimality for Matchings and Beyond
Telikepalli Kavitha, Jannik Matuschke, Ulrike Schmidt-Kraepelin
We study matching problems in which agents form one side of a bipartite graph and have preferences over objects on the other side. A central solution concept in this setting is pop…
Multi-Leader Congestion Games with an Adversary
Tobias Harks, Mona Henle, Max Klimm +2
We study a multi-leader single-follower congestion game where multiple users (leaders) choose one resource out of a set of resources and, after observing the realized loads, an adv…
Pure Nash Equilibria in Resource Graph Games
Tobias Harks, Max Klimm, Jannik Matuschke
This paper studies the existence of pure Nash equilibria in resource graph games, which are a general class of strategic games used to succinctly represent the players' private cos…
Fare Evasion in Transit Networks
José R. Correa, Tobias Harks, Vincent J. C. Kreuzen +1
Public transit systems in urban areas usually require large state subsidies, primarily due to high fare evasion rates. In this paper, we study new models for optimizing fare inspec…