3 papers
cs.GT2026
Interval Scheduling Games with Color-Based Concurrent Jobs
Vipin Ravindran Vijayalakshmi, Marc Schroder, Tami Tamir
We consider a game-theoretic variant of an interval scheduling problem. Every job is associated with a length, a weight, and a color. Each player controls all the jobs of a specifi…
cs.DS2025
Bipartite Matching with Pair-Dependent Bounds
Shaul Rosner, Tami Tamir
Let be a bipartite graph, where represents jobs and represents machines. We study a new variant of the bipartite matching problem in which each job in …
cs.GT2025
Coordination Mechanisms with Rank-Based Utilities
Gilad Lavie, Tami Tamir
In classical job-scheduling games, each job behaves as a selfish player, choosing a machine to minimize its own completion time. To reduce the equilibria inefficiency, coordination…