default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTami Tamir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Vipin Ravindran Vijayalakshmi, Marc Schröder
, Tami Tamir:
Minimizing total completion time with machine-dependent priority lists. Eur. J. Oper. Res. 315(3): 844-854 (2024)- [j43]Daniel Dadush, Martin Milanic, Tami Tamir:
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20(3): 21 (2024) - [e1]Andrei Z. Broder, Tami Tamir:
12th International Conference on Fun with Algorithms, FUN 2024, June 4-8, 2024, Island of La Maddalena, Sardinia, Italy. LIPIcs 291, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-314-0 [contents] - 2023
- [j42]Shaul Rosner, Tami Tamir:
Scheduling games with rank-based utilities. Games Econ. Behav. 140: 229-252 (2023) - [j41]Tami Tamir:
Cost-sharing games in real-time scheduling systems. Int. J. Game Theory 52(1): 273-301 (2023) - [c57]Shaul Rosner, Tami Tamir:
Entrepreneurship Facility-Activation Games. SAGT 2023: 90-108 - 2022
- [c56]Neta Stein, Tami Tamir:
Stackelberg Strategies for Weighted Load Balancing Games. FedCSIS 2022: 373-382 - [c55]Shaul Rosner, Tami Tamir:
Cost-Sharing Games with Rank-Based Utilities. SAGT 2022: 275-292 - 2021
- [j40]Eirini Georgoulaki, Kostas Kollias, Tami Tamir:
Equilibrium Inefficiency and Computation in Cost-Sharing Games in Real-Time Scheduling Systems. Algorithms 14(4): 103 (2021) - [j39]Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir:
Scheduling games with machine-dependent priority lists. Theor. Comput. Sci. 855: 90-103 (2021) - [c54]Ofek Dadush, Tami Tamir:
Achieving Good Nash Equilibrium by Temporal Addition of Dummy Players. FedCSIS 2021: 163-172 - [c53]Michal Sinai, Tami Tamir:
Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy. FedCSIS 2021: 201-209 - 2020
- [j38]Tami Tamir:
The power of one evil secret agent. Theor. Comput. Sci. 839: 1-12 (2020) - [c52]Eirini Georgoulaki, Kostas Kollias, Tami Tamir:
Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs. SAGT 2020: 83-98 - [c51]Shaul Rosner, Tami Tamir:
Race Scheduling Games. SAGT 2020: 257-272 - [i4]Michal Feldman, Yuval Snappir, Tami Tamir:
The Efficiency of Best-Response Dynamics. CoRR abs/2002.11461 (2020)
2010 – 2019
- 2019
- [c50]Michael Rapoport, Tami Tamir:
Best Response Dynamics for VLSI Physical Design Placement. FedCSIS 2019: 147-156 - [c49]Marc Schröder, Tami Tamir, Vipin Ravindran Vijayalakshmi:
Scheduling Games with Machine-Dependent Priority Lists. WINE 2019: 286-300 - [i3]Marc Schröder, Tami Tamir, Vipin Ravindran Vijayalakshmi:
Scheduling Games with Machine-Dependent Priority Lists. CoRR abs/1909.10199 (2019) - 2018
- [j37]Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80(2): 576-607 (2018) - [c48]Tami Tamir:
The Power of One Secret Agent. FUN 2018: 32:1-32:15 - [c47]Orna Kupferman, Tami Tamir:
Alternating Reachability Games with Behavioral and Revenue Objectives. LPAR 2018: 498-514 - [c46]Tami Tamir:
Cost-Sharing Games in Real-Time Scheduling Systems. WINE 2018: 423-437 - [p1]Hadas Shachnai, Tami Tamir:
Polynomial Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 125-156 - 2017
- [c45]Michal Feldman, Yuval Snappir, Tami Tamir:
The Efficiency of Best-Response Dynamics. SAGT 2017: 186-198 - [c44]Orna Kupferman, Tami Tamir:
Hierarchical Network Formation Games. TACAS (1) 2017: 229-246 - 2016
- [j36]Guy Avni, Orna Kupferman, Tami Tamir:
Network-formation games with regular objectives. Inf. Comput. 251: 165-178 (2016) - [j35]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): 38:1-38:25 (2016) - [j34]Sofia Belikovetsky, Tami Tamir:
Load rebalancing games in dynamic systems with migration costs. Theor. Comput. Sci. 622: 16-33 (2016) - [j33]Guy Avni, Tami Tamir:
Cost-sharing scheduling games on restricted unrelated machines. Theor. Comput. Sci. 646: 26-39 (2016) - [c43]Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-Time k-bounded Preemptive Scheduling. ALENEX 2016: 127-137 - [c42]Elad Iwanir, Tami Tamir:
Heuristics for Job Scheduling Reoptimization. FedCSIS 2016: 561-570 - [c41]Roy B. Ofer, Tami Tamir:
Resource Allocation Games with Multiple Resource Classes. WAOA 2016: 155-169 - 2015
- [j32]Michal Feldman, Tami Tamir:
Convergence of best-response dynamics in games with conflicting congestion effects. Inf. Process. Lett. 115(2): 112-118 (2015) - [j31]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-time scheduling to minimize machine busy times. J. Sched. 18(6): 561-573 (2015) - [c40]Guy Avni, Orna Kupferman, Tami Tamir:
Congestion Games with Multisets of Resources and Applications in Synthesis. FSTTCS 2015: 365-379 - [c39]Guy Avni, Tami Tamir:
Cost-Sharing Scheduling Games on Restricted Unrelated Machines. SAGT 2015: 69-81 - [c38]Roy B. Ofer, Tami Tamir:
Brief Announcement: Resource Allocation Games with Multiple Resource Classes. SAGT 2015: 307-308 - 2014
- [j30]Ron Adany, Tami Tamir:
Algorithms for Battery Utilization in Electric Vehicles. Appl. Artif. Intell. 28(3): 272-291 (2014) - [j29]Guy Baram, Tami Tamir:
Reoptimization of the minimum total flow-time scheduling problem. Sustain. Comput. Informatics Syst. 4(4): 241-251 (2014) - [j28]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. 553: 91-105 (2014) - [c37]Guy Avni, Orna Kupferman, Tami Tamir:
From Reachability to Temporal Specifications in Cost-Sharing Games. IJCAR 2014: 1-15 - [c36]Guy Avni, Orna Kupferman, Tami Tamir:
Network-Formation Games with Regular Objectives. FoSSaCS 2014: 119-133 - [c35]Orna Kupferman, Tami Tamir:
Properties and Utilization of Capacitated Automata (Invited Talk). FSTTCS 2014: 33-44 - [c34]Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir:
Scheduling jobs with dwindling resource requirements in clouds. INFOCOM 2014: 601-609 - [i2]Michal Feldman, Tami Tamir:
Approximate Strong Equilibrium in Job Scheduling Games. CoRR abs/1401.3494 (2014) - 2013
- [j27]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): 1843-1858 (2013) - [j26]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38(4): 729-739 (2013) - [c33]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: 13-24 - [c32]Sofia Belikovetsky, Tami Tamir:
Load Rebalancing Games in Dynamic Systems with Migration Costs. SAGT 2013: 74-85 - 2012
- [j25]Orna Kupferman, Tami Tamir:
Coping with selfish on-going behaviors. Inf. Comput. 210: 1-12 (2012) - [j24]Michal Feldman, Tami Tamir:
Conflicting Congestion Effects in Resource Allocation Games. Oper. Res. 60(3): 529-540 (2012) - [j23]Hadas Shachnai, Tami Tamir:
Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms 10: 35-48 (2012) - [j22]Tami Tamir:
Scheduling with Bully Selfish Jobs. Theory Comput. Syst. 50(1): 124-146 (2012) - [j21]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift:
Windows scheduling of arbitrary-length jobs on multiple machines. J. Sched. 15(2): 141-155 (2012) - [j20]Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. 460: 42-53 (2012) - [c31]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS 2012: 6-17 - [c30]Ron Adany, Tami Tamir:
Online Algorithm for Battery Utilization in Electric Vehicles. FedCSIS 2012: 349-356 - [c29]Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. LATIN 2012: 618-630 - [c28]Guy Baram, Tami Tamir:
Reoptimization of the Minimum Total Flow-Time Scheduling Problem. MedAlg 2012: 52-66 - [c27]Michal Feldman, Tami Tamir:
Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects. WINE 2012: 496-503 - 2011
- [i1]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. CoRR abs/1101.2940 (2011) - 2010
- [j19]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010) - [j18]Tami Tamir, Benny Vaksendiser:
Algorithms for storage allocation based on client preferences. J. Comb. Optim. 19(3): 304-324 (2010) - [j17]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): 3553-3562 (2010) - [c26]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180 - [c25]Tami Tamir:
Scheduling with Bully Selfish Jobs. FUN 2010: 355-367 - [c24]Orna Kupferman, Tami Tamir:
Coping with Selfish On-Going Behaviors. LPAR (Dakar) 2010: 501-516
2000 – 2009
- 2009
- [j16]Michal Feldman, Tami Tamir:
Approximate Strong Equilibrium in Job Scheduling Games. J. Artif. Intell. Res. 36: 387-414 (2009) - [j15]Leah Epstein, Rob van Stee, Tami Tamir:
Paging with Request Sets. Theory Comput. Syst. 44(1): 67-81 (2009) - [j14]Jirí Sgall, Hadas Shachnai, Tami Tamir:
Periodic scheduling with obligatory vacations. Theor. Comput. Sci. 410(47-49): 5112-5121 (2009) - [c23]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: 1-12 - [c22]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Maximizing submodular set functions subject to multiple linear constraints. SODA 2009: 545-554 - [c21]Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA 2009: 229-241 - 2008
- [j13]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Scheduling Techniques for Media-on-Demand. Algorithmica 52(4): 413-439 (2008) - [j12]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) - [j11]Hadas Shachnai, Tami Tamir, Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. 43(1): 81-98 (2008) - [j10]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): 3-11 (2008) - [c20]Michal Feldman, Tami Tamir:
Approximate Strong Equilibrium in Job Scheduling Games. SAGT 2008: 58-69 - [c19]Michal Feldman, Tami Tamir:
Conflicting Congestion Effects in Resource Allocation Games. WINE 2008: 109-117 - 2007
- [j9]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. Algorithmica 47(3): 343-364 (2007) - [j8]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms 3(3): 28 (2007) - [r1]Hadas Shachnai, Tami Tamir:
Polynomial-Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]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): 53-78 (2006) - [c18]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315 - [c17]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. SIROCCO 2006: 171-181 - [c16]Leah Epstein, Rob van Stee, Tami Tamir:
Paging with Request Sets. SWAT 2006: 124-135 - 2005
- [j6]Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42(3-4): 309-334 (2005) - [c15]Jirí Sgall, Hadas Shachnai, Tami Tamir:
Fairness-Free Periodic Scheduling with Vacations. ESA 2005: 592-603 - [c14]Anna R. Karlin, David Kempe, Tami Tamir:
Beyond VCG: Frugality of Truthful Mechanisms. FOCS 2005: 615-626 - [c13]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift:
Windows scheduling of arbitrary length jobs on parallel machines. SPAA 2005: 56-65 - [c12]Hadas Shachnai, Tami Tamir, Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation. WAOA 2005: 334-347 - [c11]Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir:
A General Buffer Scheme for the Windows Scheduling Problem. WEA 2005: 139-151 - 2004
- [j5]Hadas Shachnai, Tami Tamir:
Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321(1): 103-123 (2004) - [c10]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Windows scheduling as a restricted version of Bin Packing. SODA 2004: 224-233 - 2003
- [c9]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. ICALP 2003: 1123-1137 - [c8]Hadas Shachnai, Tami Tamir:
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. RANDOM-APPROX 2003: 165-177 - [c7]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Scheduling techniques for media-on-demand. SODA 2003: 791-80 - [c6]Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for Bipartite Graphs and Load Balancing. WADS 2003: 294-308 - 2002
- [j4]Hadas Shachnai, Tami Tamir:
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica 32(4): 651-678 (2002) - [c5]Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA 2002: 859-871 - [c4]Hadas Shachnai, Tami Tamir:
Tight Bounds for Online Class-Constrained Packing. LATIN 2002: 569-583 - 2001
- [b1]Tami Tamir:
Class-constrained resource allocation problems. Technion - Israel Institute of Technology, Israel, 2001 - [j3]Hadas Shachnai, Tami Tamir:
On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica 29(3): 442-467 (2001) - 2000
- [c3]Hadas Shachnai, Tami Tamir:
Polynominal time approximation schemes for class-constrained packing problem. APPROX 2000: 238-249
1990 – 1999
- 1999
- [j2]Hagit Attiya, Hadas Shachnai, Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. 28(4): 1397-1414 (1999) - 1998
- [j1]Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. 140(2): 183-202 (1998) - 1996
- [c2]Amotz Bar-Noy, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation. ISTCS 1996: 119-128 - 1994
- [c1]Hagit Attiya, Hadas Shachnai, Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing. WDAG 1994: 194-208
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
