PAPERS IN REFEREED CONFERENCE PROCEEDINGS
Leah Epstein, Elena Kleiman “Selfish vector packing”, Proc. of the 23rd European Symposium on Algorithms (ESA), 2015, pp. 471-481.
Leah Epstein, Elena Kleiman “Scheduling selfish jobs on multidimensional parallel machines”, Proc. of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 108-117.
Leah Epstein, Elena Kleiman “On the quality and complexity of Pareto equilibria in the Job Scheduling game”, Proc. of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2011, pp. 525-532.
Leah Epstein, Elena Kleiman, Julian Mestre “Parametric packing of selfish items and the Subset Sum algorithm”, Proc. of the 5th Workshop on Internet and Network Economics (WINE), 2009, pp. 67-78.
Leah Epstein, Elena Kleiman, Rob van Stee “Maximizing the minimum load: the cost of selfishness”, Proc. of the 5th Workshop on Internet and Network Economics (WINE), 2009, pp. 232-243.
Leah Epstein, Elena Kleiman “Selfish bin-packing”, Proc. of the 16th European Symposium on Algorithms (ESA), 2008, pp. 368-380.