Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Michal Feldman, Federico Fusco, Simon Mauras, and Rebecca Reiffenhäuser. Truthful Matching with Online Items and Offline Agents. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 58:1-58:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{feldman_et_al:LIPIcs.ICALP.2023.58, author = {Feldman, Michal and Fusco, Federico and Mauras, Simon and Reiffenh\"{a}user, Rebecca}, title = {{Truthful Matching with Online Items and Offline Agents}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {58:1--58:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.58}, URN = {urn:nbn:de:0030-drops-181106}, doi = {10.4230/LIPIcs.ICALP.2023.58}, annote = {Keywords: Online matching, Karp-Vazirani-Vazirani, truthfulness} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Alon Eden, Uriel Feige, and Michal Feldman. Max-Min Greedy Matching. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 7:1-7:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{eden_et_al:LIPIcs.APPROX-RANDOM.2019.7, author = {Eden, Alon and Feige, Uriel and Feldman, Michal}, title = {{Max-Min Greedy Matching}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {7:1--7:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.7}, URN = {urn:nbn:de:0030-drops-112229}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.7}, annote = {Keywords: Online matching, Pricing mechanism, Markets} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Ilan Reuven Cohen, Alon Eden, Amos Fiat, and Łukasz Jeż. Dynamic Pricing of Servers on Trees. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 10:1-10:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{cohen_et_al:LIPIcs.APPROX-RANDOM.2019.10, author = {Cohen, Ilan Reuven and Eden, Alon and Fiat, Amos and Je\.{z}, {\L}ukasz}, title = {{Dynamic Pricing of Servers on Trees}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {10:1--10:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.10}, URN = {urn:nbn:de:0030-drops-112252}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.10}, annote = {Keywords: Online algorithms, Online mechanisms, k-server problem, Online pricing} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Alon Eden, Michal Feldman, Amos Fiat, and Tzahi Taub. Truthful Prompt Scheduling for Minimizing Sum of Completion Times. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 27:1-27:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{eden_et_al:LIPIcs.ESA.2018.27, author = {Eden, Alon and Feldman, Michal and Fiat, Amos and Taub, Tzahi}, title = {{Truthful Prompt Scheduling for Minimizing Sum of Completion Times}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.27}, URN = {urn:nbn:de:0030-drops-94905}, doi = {10.4230/LIPIcs.ESA.2018.27}, annote = {Keywords: Scheduling, Mechanism design, Online algorithms} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, and Rotem Zach. Carpooling in Social Networks. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 43:1-43:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fiat_et_al:LIPIcs.ICALP.2016.43, author = {Fiat, Amos and Karlin, Anna R. and Koutsoupias, Elias and Mathieu, Claire and Zach, Rotem}, title = {{Carpooling in Social Networks}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {43:1--43:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.43}, URN = {urn:nbn:de:0030-drops-63234}, doi = {10.4230/LIPIcs.ICALP.2016.43}, annote = {Keywords: Online algorithms, Fairness, Randomized algorithms, Competitive ratio, Carpool problem} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Amos Fiat, Meital Levy, Haim Kaplan, and Svetlana Olonetsky. Strong Price of Anarchy for Machine Load Balancing. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2007)
@InProceedings{fiat_et_al:DagSemProc.07261.12, author = {Fiat, Amos and Levy, Meital and Kaplan, Haim and Olonetsky, Svetlana}, title = {{Strong Price of Anarchy for Machine Load Balancing}}, booktitle = {Fair Division}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.12}, URN = {urn:nbn:de:0030-drops-12256}, doi = {10.4230/DagSemProc.07261.12}, annote = {Keywords: Game theory, Strong Nash equilibria, Load balancing, Price of Anarchy} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Susanne Albers, Amos Fiat, and Gerhard J. Woeginger. Online Algorithms (Dagstuhl Seminar 02271). Dagstuhl Seminar Report 347, pp. 1-20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2002)
@TechReport{albers_et_al:DagSemRep.347, author = {Albers, Susanne and Fiat, Amos and Woeginger, Gerhard J.}, title = {{Online Algorithms (Dagstuhl Seminar 02271)}}, pages = {1--20}, ISSN = {1619-0203}, year = {2002}, type = {Dagstuhl Seminar Report}, number = {347}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.347}, URN = {urn:nbn:de:0030-drops-152281}, doi = {10.4230/DagSemRep.347}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Amos Fiat, Anna Karlin, and Gerhard Woeginger. Competitive Algorithms (Dagstuhl Seminar 99251). Dagstuhl Seminar Report 243, pp. 1-25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2000)
@TechReport{fiat_et_al:DagSemRep.243, author = {Fiat, Amos and Karlin, Anna and Woeginger, Gerhard}, title = {{Competitive Algorithms (Dagstuhl Seminar 99251)}}, pages = {1--25}, ISSN = {1619-0203}, year = {2000}, type = {Dagstuhl Seminar Report}, number = {243}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.243}, URN = {urn:nbn:de:0030-drops-151295}, doi = {10.4230/DagSemRep.243}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Amos Fiat and Gerhard Woeginger. On-line Algorithms (Dagstuhl Seminar 9626). Dagstuhl Seminar Report 149, pp. 1-25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (1996)
@TechReport{fiat_et_al:DagSemRep.149, author = {Fiat, Amos and Woeginger, Gerhard}, title = {{On-line Algorithms (Dagstuhl Seminar 9626)}}, pages = {1--25}, ISSN = {1619-0203}, year = {1996}, type = {Dagstuhl Seminar Report}, number = {149}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.149}, URN = {urn:nbn:de:0030-drops-150369}, doi = {10.4230/DagSemRep.149}, }
Feedback for Dagstuhl Publishing