17 citations · 24 across the 4 of their papers we have counts for
5 papers
Job-Scheduling Games with Time-Dependent Processing Times
Ido Borenstein, Tami Tamir
Job-scheduling games have traditionally assumed fixed processing times. However, in many realistic environments, ranging from cyber-security response to high-frequency trading, a t…
The Efficiency of Best-Response Dynamics
Michal Feldman, Yuval Snappir, Tami Tamir
Best response (BR) dynamics is a natural method by which players proceed toward a pure Nash equilibrium via a local search method. The quality of the equilibrium reached may depend…
Scheduling Games with Machine-Dependent Priority Lists
Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir
We consider a scheduling game on parallel related machines, in which jobs try to minimize their completion time by choosing a machine to be processed on. Each machine uses an indiv…
Approximate Strong Equilibrium in Job Scheduling Games
Michal Feldman, Tami Tamir
A Nash Equilibrium (NE) is a strategy profile resilient to unilateral deviations, and is predominantly used in the analysis of multiagent systems. A downside of NE is that it is no…
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
Ariel Kulik, Hadas Shachnai, Tami Tamir
Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location…