Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Tami Tamir. The Power of One Secret Agent. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{tamir:LIPIcs.FUN.2018.32, author = {Tamir, Tami}, title = {{The Power of One Secret Agent}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.32}, URN = {urn:nbn:de:0030-drops-88237}, doi = {10.4230/LIPIcs.FUN.2018.32}, annote = {Keywords: Job scheduling games, Cost sharing, Equilibrium inefficiency} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Guy Avni, Orna Kupferman, and Tami Tamir. Congestion Games with Multisets of Resources and Applications in Synthesis. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 365-379, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{avni_et_al:LIPIcs.FSTTCS.2015.365, author = {Avni, Guy and Kupferman, Orna and Tamir, Tami}, title = {{Congestion Games with Multisets of Resources and Applications in Synthesis}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {365--379}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.365}, URN = {urn:nbn:de:0030-drops-56358}, doi = {10.4230/LIPIcs.FSTTCS.2015.365}, annote = {Keywords: Congestion games, Multiset strategies, Equilibrium existence and computation, Equilibrium inefficiency} }
Published in: LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Orna Kupferman and Tami Tamir. Properties and Utilization of Capacitated Automata (Invited Talk). In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 33-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{kupferman_et_al:LIPIcs.FSTTCS.2014.33, author = {Kupferman, Orna and Tamir, Tami}, title = {{Properties and Utilization of Capacitated Automata}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {33--44}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-77-4}, ISSN = {1868-8969}, year = {2014}, volume = {29}, editor = {Raman, Venkatesh and Suresh, S. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.33}, URN = {urn:nbn:de:0030-drops-48306}, doi = {10.4230/LIPIcs.FSTTCS.2014.33}, annote = {Keywords: Automata, Capacitated transitions, Determinization, Maximum utilization} }
Published in: LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, and Tami Tamir. Minimizing Busy Time in Multiple Machine Real-time Scheduling. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 169-180, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{khandekar_et_al:LIPIcs.FSTTCS.2010.169, author = {Khandekar, Rohit and Schieber, Baruch and Shachnai, Hadas and Tamir, Tami}, title = {{Minimizing Busy Time in Multiple Machine Real-time Scheduling}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {169--180}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-23-1}, ISSN = {1868-8969}, year = {2010}, volume = {8}, editor = {Lodaya, Kamal and Mahajan, Meena}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.169}, URN = {urn:nbn:de:0030-drops-28909}, doi = {10.4230/LIPIcs.FSTTCS.2010.169}, annote = {Keywords: real-time scheduling, busy time, preemption, approximation algorithm} }
Feedback for Dagstuhl Publishing