Tami Tamir

Vipin Ravindran Vijayalakshmi

ACM Trans. Algorithms, July, 2024

Minimizing total completion time with machine-dependent priority lists.

[BibT_eX]

[DOI]

Marc Schröder

Eur. J. Oper. Res., 2024

2023

Cost-sharing games in real-time scheduling systems.

[BibT_eX]

[DOI]

Int. J. Game Theory, March, 2023

Scheduling games with rank-based utilities.

[BibT_eX]

[DOI]

Games Econ. Behav., 2023

Entrepreneurship Facility-Activation Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2022

Cost-Sharing Games with Rank-Based Utilities.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Stackelberg Strategies for Weighted Load Balancing Games.

[BibT_eX]

[DOI]

Neta Stein

Vipin Ravindran Vijayalakshmi

Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022

2021

Scheduling games with machine-dependent priority lists.

[BibT_eX]

[DOI]

Marc Schröder

Theor. Comput. Sci., 2021

Equilibrium Inefficiency and Computation in Cost-Sharing Games in Real-Time Scheduling Systems.

[BibT_eX]

[DOI]

Eirini Georgoulaki

Kostas Kollias

Algorithms, 2021

Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy.

[BibT_eX]

[DOI]

Michal Sinai

Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

Achieving Good Nash Equilibrium by Temporal Addition of Dummy Players.

[BibT_eX]

[DOI]

Ofek Dadush

Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

2020

The power of one evil secret agent.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Race Scheduling Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs.

[BibT_eX]

[DOI]

Eirini Georgoulaki

Kostas Kollias

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

2019

Best Response Dynamics for VLSI Physical Design Placement.

[BibT_eX]

[DOI]

Michael Rapoport

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

2018

A Theory and Algorithms for Combinatorial Reoptimization.

[BibT_eX]

[DOI]

Algorithmica, 2018

Alternating Reachability Games with Behavioral and Revenue Objectives.

[BibT_eX]

[DOI]

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

The Power of One Secret Agent.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Polynomial Time Approximation Schemes.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Hierarchical Network Formation Games.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

The Efficiency of Best-Response Dynamics.

[BibT_eX]

[DOI]

Yuval Snappir

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Load rebalancing games in dynamic systems with migration costs.

[BibT_eX]

[DOI]

Sofia Belikovetsky

Theor. Comput. Sci., 2016

Cost-sharing scheduling games on restricted unrelated machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Network-formation games with regular objectives.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Resource Allocation Games with Multiple Resource Classes.

[BibT_eX]

[DOI]

Roy B. Ofer

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Heuristics for Job Scheduling Reoptimization.

[BibT_eX]

[DOI]

Elad Iwanir

Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Real-Time k-bounded Preemptive Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Real-time scheduling to minimize machine busy times.

[BibT_eX]

[DOI]

J. Sched., 2015

Convergence of best-response dynamics in games with conflicting congestion effects.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Brief Announcement: Resource Allocation Games with Multiple Resource Classes.

[BibT_eX]

[DOI]

Roy B. Ofer

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Congestion Games with Multisets of Resources and Applications in Synthesis.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Packing resizable items with application to video delivery over wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Reoptimization of the minimum total flow-time scheduling problem.

[BibT_eX]

[DOI]

Guy Baram

Sustain. Comput. Informatics Syst., 2014

Algorithms for Battery Utilization in Electric Vehicles.

[BibT_eX]

[DOI]

Ron Adany

Appl. Artif. Intell., 2014

Scheduling jobs with dwindling resource requirements in clouds.

[BibT_eX]

[DOI]

Sivan Albagli-Kim

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Properties and Utilization of Capacitated Automata (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

From Reachability to Temporal Specifications in Cost-Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints.

[BibT_eX]

[DOI]

Ariel Kulik

Math. Oper. Res., 2013

Approximate strong equilibria in job scheduling games with two uniformly related machines.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Minimal cost reconfiguration of data placement in a storage area network.

[BibT_eX]

[DOI]

Gal Tamir

Theor. Comput. Sci., 2012

Windows scheduling of arbitrary-length jobs on multiple machines.

[BibT_eX]

[DOI]

J. Sched., 2012

Scheduling with Bully Selfish Jobs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Approximation schemes for generalized two-dimensional vector packing with application to data placement.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Conflicting Congestion Effects in Resource Allocation Games.

[BibT_eX]

[DOI]

Oper. Res., 2012

Coping with selfish on-going behaviors.

[BibT_eX]

[DOI]

Inf. Comput., 2012

A Theory and Algorithms for Combinatorial Reoptimization.

[BibT_eX]

[DOI]

Gal Tamir

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Online Algorithm for Battery Utilization in Electric Vehicles.

[BibT_eX]

[DOI]

Ron Adany

Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2011

Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints

[BibT_eX]

[DOI]

Ariel Kulik

CoRR, 2011

2010

Minimizing total busy time in parallel scheduling with application to optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Algorithms for storage allocation based on client preferences.

[BibT_eX]

[DOI]

Benny Vaksendiser

J. Comb. Optim., 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.

[BibT_eX]

[DOI]

Algorithmica, 2010

Minimizing Busy Time in Multiple Machine Real-time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Periodic scheduling with obligatory vacations.

[BibT_eX]

[DOI]

Jirí Sgall

Theor. Comput. Sci., 2009

Paging with Request Sets.

[BibT_eX]

[DOI]

Leah Epstein

Rob van Stee

Theory Comput. Syst., 2009

Approximate Strong Equilibrium in Job Scheduling Games.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2009

Maximizing submodular set functions subject to multiple linear constraints.

[BibT_eX]

[DOI]

Ariel Kulik

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Optimal delay for media-on-demand with pre-loading and pre-buffering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Approximation Schemes for Packing with Item Fragmentation.

[BibT_eX]

[DOI]

Omer Yehezkely

Theory Comput. Syst., 2008

A general buffer scheme for the windows scheduling problem.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Scheduling Techniques for Media-on-Demand.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

Polynomial-Time Approximation Schemes.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Windows scheduling as a restricted version of bin packing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Real-Time Scheduling with a Budget.

[BibT_eX]

[DOI]

Joseph Naor

Algorithmica, 2007

2006

Semi-matchings for bipartite graphs and load balancing.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

László Lovász

J. Algorithms, 2006

2005

Minimizing Makespan and Preemption Costs on a System of Uniform Machines.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Algorithmica, 2005

Windows scheduling of arbitrary length jobs on parallel machines.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Beyond VCG: Frugality of Truthful Mechanisms.

[BibT_eX]

[DOI]

Anna R. Karlin

David Kempe

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Fairness-Free Periodic Scheduling with Vacations.

[BibT_eX]

[DOI]

Jirí Sgall

Proceedings of the Algorithms, 2005

2004

Tight bounds for online class-constrained packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

2002

Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2002

2001

Class-constrained resource allocation problems.

[BibT_eX]

[DOI]

PhD thesis, 2001

On Two Class-Constrained Versions of the Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Algorithmica, 2001

2000

Polynominal time approximation schemes for class-constrained packing problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Local Labeling and Resource Allocation Using Preprocessing.

[BibT_eX]

[DOI]

Hagit Attiya

SIAM J. Comput., 1999

1998

On Chromatic Sums and Distributed Resource Allocation.

[BibT_eX]

[DOI]

Mihir Bellare

Magnús M. Halldórsson

Inf. Comput., 1998

1996

On Chromatic Sums and Distributed Resource Allocation.

[BibT_eX]