Tami Tamir

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 31

Top Venues

Publications

Daniel Dadush, Martin Milanic, Tami Tamir
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20 (3) (2024)
Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir
Minimizing total completion time with machine-dependent priority lists. Eur. J. Oper. Res. 315 (3) (2024)
Shaul Rosner, Tami Tamir
Scheduling games with rank-based utilities. Games Econ. Behav. 140 (2023)
Tami Tamir
Cost-sharing games in real-time scheduling systems. Int. J. Game Theory 52 (1) (2023)
Shaul Rosner, Tami Tamir
Entrepreneurship Facility-Activation Games. SAGT (2023)
Neta Stein, Tami Tamir
Stackelberg Strategies for Weighted Load Balancing Games. FedCSIS (2022)
Shaul Rosner, Tami Tamir
Cost-Sharing Games with Rank-Based Utilities. SAGT (2022)
Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir
Scheduling games with machine-dependent priority lists. Theor. Comput. Sci. 855 (2021)
Eirini Georgoulaki, Kostas Kollias, Tami Tamir
Equilibrium Inefficiency and Computation in Cost-Sharing Games in Real-Time Scheduling Systems. Algorithms 14 (4) (2021)
Michal Sinai, Tami Tamir
Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy. FedCSIS (2021)
Ofek Dadush, Tami Tamir
Achieving Good Nash Equilibrium by Temporal Addition of Dummy Players. FedCSIS (2021)
Eirini Georgoulaki, Kostas Kollias, Tami Tamir
Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs. SAGT (2020)
Shaul Rosner, Tami Tamir
Race Scheduling Games. SAGT (2020)
Michal Feldman, Yuval Snappir, Tami Tamir
The Efficiency of Best-Response Dynamics. CoRR (2020)
Tami Tamir
The power of one evil secret agent. Theor. Comput. Sci. 839 (2020)
Marc Schröder, Tami Tamir, Vipin Ravindran Vijayalakshmi
Scheduling Games with Machine-Dependent Priority Lists. CoRR (2019)
Marc Schröder, Tami Tamir, Vipin Ravindran Vijayalakshmi
Scheduling Games with Machine-Dependent Priority Lists. WINE (2019)
Michael Rapoport, Tami Tamir
Best Response Dynamics for VLSI Physical Design Placement. FedCSIS (2019)
Orna Kupferman, Tami Tamir
Alternating Reachability Games with Behavioral and Revenue Objectives. LPAR (2018)
Tami Tamir
Cost-Sharing Games in Real-Time Scheduling Systems. WINE (2018)
Tami Tamir
The Power of One Secret Agent. FUN (2018)
Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80 (2) (2018)
Michal Feldman, Yuval Snappir, Tami Tamir
The Efficiency of Best-Response Dynamics. SAGT (2017)
Orna Kupferman, Tami Tamir
Hierarchical Network Formation Games. TACAS (1) (2017)
Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir
Real-Time k-bounded Preemptive Scheduling. ALENEX (2016)
Guy Avni, Tami Tamir
Cost-sharing scheduling games on restricted unrelated machines. Theor. Comput. Sci. 646 (2016)
Guy Avni, Orna Kupferman, Tami Tamir
Network-formation games with regular objectives. Inf. Comput. 251 (2016)
Sofia Belikovetsky, Tami Tamir
Load rebalancing games in dynamic systems with migration costs. Theor. Comput. Sci. 622 (2016)
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12 (3) (2016)
Elad Iwanir, Tami Tamir
Heuristics for Job Scheduling Reoptimization. FedCSIS (2016)
Roy B. Ofer, Tami Tamir
Resource Allocation Games with Multiple Resource Classes. WAOA (2016)
Guy Avni, Tami Tamir
Cost-Sharing Scheduling Games on Restricted Unrelated Machines. SAGT (2015)
Roy B. Ofer, Tami Tamir
Brief Announcement: Resource Allocation Games with Multiple Resource Classes. SAGT (2015)
Michal Feldman, Tami Tamir
Convergence of best-response dynamics in games with conflicting congestion effects. Inf. Process. Lett. 115 (2) (2015)
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
Real-time scheduling to minimize machine busy times. J. Sched. 18 (6) (2015)
Guy Avni, Orna Kupferman, Tami Tamir
Congestion Games with Multisets of Resources and Applications in Synthesis. FSTTCS (2015)
Orna Kupferman, Tami Tamir
Properties and Utilization of Capacitated Automata (Invited Talk). FSTTCS (2014)
Guy Avni, Orna Kupferman, Tami Tamir
Network-Formation Games with Regular Objectives. FoSSaCS (2014)
Michal Feldman, Tami Tamir
Approximate Strong Equilibrium in Job Scheduling Games. CoRR (2014)
Ron Adany, Tami Tamir
Algorithms for Battery Utilization in Electric Vehicles. Appl. Artif. Intell. 28 (3) (2014)
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. 553 (2014)
Guy Avni, Orna Kupferman, Tami Tamir
From Reachability to Temporal Specifications in Cost-Sharing Games. IJCAR (2014)
Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir
Scheduling jobs with dwindling resource requirements in clouds. INFOCOM (2014)
Guy Baram, Tami Tamir
Reoptimization of the minimum total flow-time scheduling problem. Sustain. Comput. Informatics Syst. 4 (4) (2014)
Sofia Belikovetsky, Tami Tamir
Load Rebalancing Games in Dynamic Systems with Migration Costs. SAGT (2013)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38 (4) (2013)
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO (2013)
Leah Epstein, Michal Feldman, Tami Tamir, Lukasz Witkowski, Marcin Witkowski
Approximate strong equilibria in job scheduling games with two uniformly related machines. Discret. Appl. Math. 161 (13-14) (2013)
Ron Adany, Tami Tamir
Online Algorithm for Battery Utilization in Electric Vehicles. FedCSIS (2012)
Guy Baram, Tami Tamir
Reoptimization of the Minimum Total Flow-Time Scheduling Problem. MedAlg (2012)
Hadas Shachnai, Tami Tamir
Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms 10 (2012)
Hadas Shachnai, Gal Tamir, Tami Tamir
Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. 460 (2012)
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS (2012)
Tami Tamir
Scheduling with Bully Selfish Jobs. Theory Comput. Syst. 50 (1) (2012)
Michal Feldman, Tami Tamir
Conflicting Congestion Effects in Resource Allocation Games. Oper. Res. 60 (3) (2012)
Hadas Shachnai, Gal Tamir, Tami Tamir
A Theory and Algorithms for Combinatorial Reoptimization. LATIN (2012)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift
Windows scheduling of arbitrary-length jobs on multiple machines. J. Sched. 15 (2) (2012)
Michal Feldman, Tami Tamir
Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects. WINE (2012)
Orna Kupferman, Tami Tamir
Coping with selfish on-going behaviors. Inf. Comput. 210 (2012)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints CoRR (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411 (40-42) (2010)
Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57 (1) (2010)
Tami Tamir
Scheduling with Bully Selfish Jobs. FUN (2010)
Orna Kupferman, Tami Tamir
Coping with Selfish On-Going Behaviors. LPAR (Dakar) (2010)
Tami Tamir, Benny Vaksendiser
Algorithms for storage allocation based on client preferences. J. Comb. Optim. 19 (3) (2010)
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS (2010)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Maximizing submodular set functions subject to multiple linear constraints. SODA (2009)
Leah Epstein, Rob van Stee, Tami Tamir
Paging with Request Sets. Theory Comput. Syst. 44 (1) (2009)
Michal Feldman, Tami Tamir
Approximate Strong Equilibrium in Job Scheduling Games. J. Artif. Intell. Res. 36 (2009)
Hadas Shachnai, Gal Tamir, Tami Tamir
Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA (2009)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS (2009)
Jirí Sgall, Hadas Shachnai, Tami Tamir
Periodic scheduling with obligatory vacations. Theor. Comput. Sci. 410 (47-49) (2009)
Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir
A general buffer scheme for the windows scheduling problem. ACM J. Exp. Algorithmics 13 (2008)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Optimal delay for media-on-demand with pre-loading and pre-buffering. Theor. Comput. Sci. 399 (1-2) (2008)
Michal Feldman, Tami Tamir
Conflicting Congestion Effects in Resource Allocation Games. WINE (2008)
Hadas Shachnai, Tami Tamir, Omer Yehezkely
Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. 43 (1) (2008)
Michal Feldman, Tami Tamir
Approximate Strong Equilibrium in Job Scheduling Games. SAGT (2008)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Scheduling Techniques for Media-on-Demand. Algorithmica 52 (4) (2008)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms 3 (3) (2007)
Joseph Naor, Hadas Shachnai, Tami Tamir
Real-Time Scheduling with a Budget. Algorithmica 47 (3) (2007)
Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
Transactional contention management as a non-clairvoyant scheduling problem. PODC (2006)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. SIROCCO (2006)
Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59 (1) (2006)
Leah Epstein, Rob van Stee, Tami Tamir
Paging with Request Sets. SWAT (2006)
Anna R. Karlin, David Kempe, Tami Tamir
Beyond VCG: Frugality of Truthful Mechanisms. FOCS (2005)
Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir
A General Buffer Scheme for the Windows Scheduling Problem. WEA (2005)
Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42 (3-4) (2005)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift
Windows scheduling of arbitrary length jobs on parallel machines. SPAA (2005)
Hadas Shachnai, Tami Tamir, Omer Yehezkely
Approximation Schemes for Packing with Item Fragmentation. WAOA (2005)
Jirí Sgall, Hadas Shachnai, Tami Tamir
Fairness-Free Periodic Scheduling with Vacations. ESA (2005)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Windows scheduling as a restricted version of Bin Packing. SODA (2004)
Hadas Shachnai, Tami Tamir
Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321 (1) (2004)
Joseph Naor, Hadas Shachnai, Tami Tamir
Real-Time Scheduling with a Budget. ICALP (2003)
Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
Semi-matchings for Bipartite Graphs and Load Balancing. WADS (2003)
Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Scheduling techniques for media-on-demand. SODA (2003)
Hadas Shachnai, Tami Tamir
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. RANDOM-APPROX (2003)
Hadas Shachnai, Tami Tamir
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica 32 (4) (2002)
Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA (2002)
Hadas Shachnai, Tami Tamir
Tight Bounds for Online Class-Constrained Packing. LATIN (2002)
Hadas Shachnai, Tami Tamir
On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica 29 (3) (2001)

Tami Tamir.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tami Tamir