Elena Kleiman

According to our database, Elena Kleiman authored at least 10 papers between 2009 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Selfish Vector Packing.

Leah Epstein, Elena Kleiman

Algorithmica, 2021

2017

Scheduling selfish jobs on multidimensional parallel machines.

Leah Epstein, Elena Kleiman

Theor. Comput. Sci., 2017

2016

Parametric Packing of Selfish Items and the Subset Sum Algorithm.

Leah Epstein, Elena Kleiman, Julián Mestre

Algorithmica, 2016

2014

The cost of selfishness for maximizing the minimum load on uniformly related machines.

Leah Epstein, Elena Kleiman, Rob van Stee

J. Comb. Optim., 2014

2013

Maximizing the minimum load: The cost of selfishness.

Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee

Theor. Comput. Sci., 2013

2011

Packing, Scheduling and Covering Problems in a Game-Theoretic Perspective

Elena Kleiman

CoRR, 2011

Selfish Bin Packing.

Leah Epstein, Elena Kleiman

Algorithmica, 2011

On the quality and complexity of pareto equilibria in the job scheduling game.

Leah Epstein, Elena Kleiman

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2009

Resource augmented semi-online bounded space bin packing.

Leah Epstein, Elena Kleiman

Discret. Appl. Math., 2009

Maximizing the Minimum Load: The Cost of Selfishness.

Leah Epstein, Elena Kleiman, Rob van Stee

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009