Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Guido Schäfer
@article{DBLP:journals/corr/abs-2403-03725,
author = {Riccardo Colini{-}Baldeschi and
Sophie Klumper and
Guido Sch{\"{a}}fer and
Artem Tsikiridis},
title = {To Trust or Not to Trust: Assignment Mechanisms with Predictions in
the Private Graph Model},
journal = {CoRR},
volume = {abs/2403.03725},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.03725},
doi = {10.48550/ARXIV.2403.03725},
eprinttype = {arXiv},
eprint = {2403.03725},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-03725.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-08839,
author = {Willem Feijen and
Guido Sch{\"{a}}fer and
Koen Dekker and
Seppo Pieterse},
title = {Learning-Enhanced Neighborhood Selection for the Vehicle Routing Problem
with Time Windows},
journal = {CoRR},
volume = {abs/2403.08839},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.08839},
doi = {10.48550/ARXIV.2403.08839},
eprinttype = {arXiv},
eprint = {2403.08839},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-08839.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KashaevS23,
author = {Danish Kashaev and
Guido Sch{\"{a}}fer},
editor = {Nicole Megow and
Adam D. Smith},
title = {Round and Bipartize for Vertex Cover Approximation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {20:1--20:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.20},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.20},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/KashaevS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AmanatidisKMST23,
author = {Georgios Amanatidis and
Sophie Klumper and
Evangelos Markakis and
Guido Sch{\"{a}}fer and
Artem Tsikiridis},
editor = {Jugal Garg and
Max Klimm and
Yuqing Kong},
title = {Partial Allocations in Budget-Feasible Mechanism Design: Bridging
Multiple Levels of Service and Divisible Agents},
booktitle = {Web and Internet Economics - 19th International Conference, {WINE}
2023, Shanghai, China, December 4-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14413},
pages = {41--58},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-48974-7\_3},
doi = {10.1007/978-3-031-48974-7\_3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/AmanatidisKMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07385,
author = {Georgios Amanatidis and
Sophie Klumper and
Evangelos Markakis and
Guido Sch{\"{a}}fer and
Artem Tsikiridis},
title = {Partial Allocations in Budget-Feasible Mechanism Design: Bridging
Multiple Levels of Service and Divisible Agents},
journal = {CoRR},
volume = {abs/2307.07385},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07385},
doi = {10.48550/ARXIV.2307.07385},
eprinttype = {arXiv},
eprint = {2307.07385},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/HuizingMSB22,
author = {Dylan Huizing and
Rob van der Mei and
Guido Sch{\"{a}}fer and
Sandjai Bhulai},
title = {The enriched median routing problem and its usefulness in practice},
journal = {Comput. Ind. Eng.},
volume = {168},
pages = {108063},
year = {2022},
url = {https://doi.org/10.1016/j.cie.2022.108063},
doi = {10.1016/J.CIE.2022.108063},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/candie/HuizingMSB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AmanatidisKS22,
author = {Georgios Amanatidis and
Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives:
Offline and Online},
journal = {Math. Oper. Res.},
volume = {47},
number = {3},
pages = {2286--2309},
year = {2022},
url = {https://doi.org/10.1287/moor.2021.1208},
doi = {10.1287/MOOR.2021.1208},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/AmanatidisKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/BirmpasMS22,
author = {Georgios Birmpas and
Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Cost Sharing over Combinatorial Domains},
journal = {{ACM} Trans. Economics and Comput.},
volume = {10},
number = {1},
pages = {4:1--4:26},
year = {2022},
url = {https://doi.org/10.1145/3505586},
doi = {10.1145/3505586},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/BirmpasMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BeekBS22,
author = {Andries van Beek and
Ruben Brokkelkamp and
Guido Sch{\"{a}}fer},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {1283--1291},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p1283.pdf},
doi = {10.5555/3535850.3535993},
timestamp = {Mon, 18 Jul 2022 17:13:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/BeekBS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BrokkelkampHS22,
author = {Ruben Brokkelkamp and
Sjir Hoeijmakers and
Guido Sch{\"{a}}fer},
editor = {Panagiotis Kanellopoulos and
Maria Kyropoulou and
Alexandros A. Voudouris},
title = {Greater Flexibility in Mechanism Design Through Altruism},
booktitle = {Algorithmic Game Theory - 15th International Symposium, {SAGT} 2022,
Colchester, UK, September 12-15, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13584},
pages = {41--59},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15714-1\_3},
doi = {10.1007/978-3-031-15714-1\_3},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/BrokkelkampHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KlumperS22,
author = {Sophie Klumper and
Guido Sch{\"{a}}fer},
editor = {Panagiotis Kanellopoulos and
Maria Kyropoulou and
Alexandros A. Voudouris},
title = {Budget Feasible Mechanisms for Procurement Auctions with Divisible
Agents},
booktitle = {Algorithmic Game Theory - 15th International Symposium, {SAGT} 2022,
Colchester, UK, September 12-15, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13584},
pages = {78--93},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15714-1\_5},
doi = {10.1007/978-3-031-15714-1\_5},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KlumperS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-13124,
author = {Sophie Klumper and
Guido Sch{\"{a}}fer},
title = {Budget Feasible Mechanisms for Procurement Auctions with Divisible
Agents},
journal = {CoRR},
volume = {abs/2206.13124},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.13124},
doi = {10.48550/ARXIV.2206.13124},
eprinttype = {arXiv},
eprint = {2206.13124},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-13124.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01699,
author = {Danish Kashaev and
Guido Sch{\"{a}}fer},
title = {A Round and Bipartize Approximation Algorithm for Vertex Cover},
journal = {CoRR},
volume = {abs/2211.01699},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01699},
doi = {10.48550/ARXIV.2211.01699},
eprinttype = {arXiv},
eprint = {2211.01699},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KleerS21,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Computation and efficiency of potential function minimizers of combinatorial
congestion games},
journal = {Math. Program.},
volume = {190},
number = {1},
pages = {523--560},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01546-6},
doi = {10.1007/S10107-020-01546-6},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/KleerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HuizingS21,
author = {Dylan Huizing and
Guido Sch{\"{a}}fer},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {The Traveling k-Median Problem: Approximating Optimal Network Coverage},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {80--98},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_6},
doi = {10.1007/978-3-030-92702-8\_6},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/HuizingS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-01822,
author = {Andries van Beek and
Ruben Brokkelkamp and
Guido Sch{\"{a}}fer},
title = {Capturing Corruption with Hybrid Auctions: Social Welfare Loss in
Multi-Unit Auctions},
journal = {CoRR},
volume = {abs/2106.01822},
year = {2021},
url = {https://arxiv.org/abs/2106.01822},
eprinttype = {arXiv},
eprint = {2106.01822},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-01822.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-11927,
author = {Willem Feijen and
Guido Sch{\"{a}}fer},
title = {Using Machine Learning Predictions to Speed-up Dijkstra's Shortest
Path Algorithm},
journal = {CoRR},
volume = {abs/2112.11927},
year = {2021},
url = {https://arxiv.org/abs/2112.11927},
eprinttype = {arXiv},
eprint = {2112.11927},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-11927.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HuizingSMB20,
author = {Dylan Huizing and
Guido Sch{\"{a}}fer and
Rob D. van der Mei and
Sandjai Bhulai},
title = {The median routing problem for simultaneous planning of emergency
response and non-emergency jobs},
journal = {Eur. J. Oper. Res.},
volume = {285},
number = {2},
pages = {712--727},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2020.02.002},
doi = {10.1016/J.EJOR.2020.02.002},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/HuizingSMB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/SchaferZ20,
author = {Guido Sch{\"{a}}fer and
Bernard G. Zweers},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Maximum Coverage with Cluster Constraints: An LP-Based Approximation
Technique},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {63--80},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_5},
doi = {10.1007/978-3-030-80879-2\_5},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/SchaferZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-09717,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Topological Price of Anarchy Bounds for Clustering Games on Networks},
journal = {CoRR},
volume = {abs/2011.09717},
year = {2020},
url = {https://arxiv.org/abs/2011.09717},
eprinttype = {arXiv},
eprint = {2011.09717},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-09717.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-04420,
author = {Guido Sch{\"{a}}fer and
Bernard G. Zweers},
title = {Maximum Coverage with Cluster Constraints: An LP-Based Approximation
Technique},
journal = {CoRR},
volume = {abs/2012.04420},
year = {2020},
url = {https://arxiv.org/abs/2012.04420},
eprinttype = {arXiv},
eprint = {2012.04420},
timestamp = {Wed, 09 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-04420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KleerS19,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {The Impact of Worst-Case Deviations in Non-Atomic Network Routing
Games},
journal = {Theory Comput. Syst.},
volume = {63},
number = {1},
pages = {54--89},
year = {2019},
url = {https://doi.org/10.1007/s00224-017-9829-y},
doi = {10.1007/S00224-017-9829-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KleerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KleerS19,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Tight inefficiency bounds for perception-parameterized affine congestion
games},
journal = {Theor. Comput. Sci.},
volume = {754},
pages = {65--87},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.04.025},
doi = {10.1016/J.TCS.2018.04.025},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KleerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ec/AmanatidisKS19,
author = {Georgios Amanatidis and
Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Anna R. Karlin and
Nicole Immorlica and
Ramesh Johari},
title = {Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives:
Offline and Online},
booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation,
{EC} 2019, Phoenix, AZ, USA, June 24-28, 2019},
pages = {901--919},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3328526.3329622},
doi = {10.1145/3328526.3329622},
timestamp = {Thu, 04 Apr 2024 16:56:10 +0200},
biburl = {https://dblp.org/rec/conf/ec/AmanatidisKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BirmpasMS19,
author = {Georgios Birmpas and
Evangelos Markakis and
Guido Sch{\"{a}}fer},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions
and Beyond},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.20},
doi = {10.4230/LIPICS.ESA.2019.20},
timestamp = {Sun, 08 Sep 2019 01:20:11 +0200},
biburl = {https://dblp.org/rec/conf/esa/BirmpasMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrokkelkampPSV19,
author = {Ruben Brokkelkamp and
Sven C. Polak and
Guido Sch{\"{a}}fer and
Yllka Velaj},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Approximate Pricing in Networks: How to Boost the Betweenness and
Revenue of a Node},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.13},
doi = {10.4230/LIPICS.ISAAC.2019.13},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrokkelkampPSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/KleerS19,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Ioannis Caragiannis and
Vahab S. Mirrokni and
Evdokia Nikolova},
title = {Topological Price of Anarchy Bounds for Clustering Games on Networks},
booktitle = {Web and Internet Economics - 15th International Conference, {WINE}
2019, New York, NY, USA, December 10-12, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11920},
pages = {241--255},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-35389-6\_18},
doi = {10.1007/978-3-030-35389-6\_18},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/KleerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00848,
author = {Georgios Amanatidis and
Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives:
Offline and Online},
journal = {CoRR},
volume = {abs/1905.00848},
year = {2019},
url = {http://arxiv.org/abs/1905.00848},
eprinttype = {arXiv},
eprint = {1905.00848},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-06384,
author = {Georgios Birmpas and
Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions
and Beyond},
journal = {CoRR},
volume = {abs/1910.06384},
year = {2019},
url = {http://arxiv.org/abs/1910.06384},
eprinttype = {arXiv},
eprint = {1910.06384},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-06384.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/GroenlandS18,
author = {Carla Groenland and
Guido Sch{\"{a}}fer},
editor = {Elisabeth Andr{\'{e}} and
Sven Koenig and
Mehdi Dastani and
Gita Sukthankar},
title = {The Curse of Ties in Congestion Games with Limited Lookahead},
booktitle = {Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},
pages = {1941--1943},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3238031},
timestamp = {Sat, 30 Sep 2023 09:34:53 +0200},
biburl = {https://dblp.org/rec/conf/atal/GroenlandS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/RodriguesSX18,
author = {F{\'{e}}lix Carvalho Rodrigues and
Guido Sch{\"{a}}fer and
Eduardo C. Xavier},
editor = {Alessandro Aldini and
Marco Bernardo},
title = {On the Effectiveness of Connection Tolls in Fair Cost Facility Location
Games},
booktitle = {Proceedings of the 19th Italian Conference on Theoretical Computer
Science, Urbino, Italy, September 18-20, 2018},
series = {{CEUR} Workshop Proceedings},
volume = {2243},
pages = {36--47},
publisher = {CEUR-WS.org},
year = {2018},
url = {https://ceur-ws.org/Vol-2243/paper2.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/RodriguesSX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/RodriguesXS19,
author = {F{\'{e}}lix Carvalho Rodrigues and
Eduardo C. Xavier and
Guido Sch{\"{a}}fer},
editor = {Val{\'{e}}ria Farinazzo Martins and
Adenilso Sim{\~{a}}o and
H{\'{e}}ctor Cancela},
title = {On Fair Cost Facility Location Games with Non-singleton Players},
booktitle = {{XLIV} Latin American Computer Conference - Selected Papers, {CLEI}
2018 Selected Papers, S{\~{a}}o Paulo, Brazil, October 1-5, 2018},
series = {Electronic Notes in Theoretical Computer Science},
volume = {342},
pages = {21--38},
publisher = {Elsevier},
year = {2018},
url = {https://doi.org/10.1016/j.entcs.2019.04.003},
doi = {10.1016/J.ENTCS.2019.04.003},
timestamp = {Wed, 14 Jun 2023 08:50:27 +0200},
biburl = {https://dblp.org/rec/journals/entcs/RodriguesXS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07107,
author = {Carla Groenland and
Guido Sch{\"{a}}fer},
title = {The Curse of Ties in Congestion Games with Limited Lookahead},
journal = {CoRR},
volume = {abs/1804.07107},
year = {2018},
url = {http://arxiv.org/abs/1804.07107},
eprinttype = {arXiv},
eprint = {1804.07107},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/AptKRSS17,
author = {Krzysztof R. Apt and
Bart de Keijzer and
Mona Rahn and
Guido Sch{\"{a}}fer and
Sunil Simon},
title = {Coordination games on graphs},
journal = {Int. J. Game Theory},
volume = {46},
number = {3},
pages = {851--877},
year = {2017},
url = {https://doi.org/10.1007/s00182-016-0560-8},
doi = {10.1007/S00182-016-0560-8},
timestamp = {Mon, 07 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgt/AptKRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KleerS17,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion
Games},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {381--392},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_32},
doi = {10.1007/978-3-319-57586-5\_32},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/KleerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KleerS17,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Vittorio Bil{\`{o}} and
Michele Flammini},
title = {Path Deviations Outperform Approximate Stability in Heterogeneous
Congestion Games},
booktitle = {Algorithmic Game Theory - 10th International Symposium, {SAGT} 2017,
L'Aquila, Italy, September 12-14, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10504},
pages = {212--224},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66700-3\_17},
doi = {10.1007/978-3-319-66700-3\_17},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KleerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/KleerS17,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Constantinos Daskalakis and
Moshe Babaioff and
Herv{\'{e}} Moulin},
title = {Potential Function Minimizers of Combinatorial Congestion Games: Efficiency
and Computation},
booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
{EC} '17, Cambridge, MA, USA, June 26-30, 2017},
pages = {223--240},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3033274.3085149},
doi = {10.1145/3033274.3085149},
timestamp = {Mon, 30 Jan 2023 21:01:44 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/KleerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KleerS17,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion
Games},
journal = {CoRR},
volume = {abs/1701.07614},
year = {2017},
url = {http://arxiv.org/abs/1701.07614},
eprinttype = {arXiv},
eprint = {1701.07614},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KleerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KleerS17aa,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {Path deviations outperform approximate stability in heterogeneous
congestion games},
journal = {CoRR},
volume = {abs/1707.01278},
year = {2017},
url = {http://arxiv.org/abs/1707.01278},
eprinttype = {arXiv},
eprint = {1707.01278},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KleerS17aa.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/StaerelingKS16,
author = {Irving van Heuven van Staereling and
Bart de Keijzer and
Guido Sch{\"{a}}fer},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {The Ground-Set-Cost Budgeted Maximum Coverage Problem},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {50:1--50:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.50},
doi = {10.4230/LIPICS.MFCS.2016.50},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/StaerelingKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KleerS16,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Martin Gairing and
Rahul Savani},
title = {The Impact of Worst-Case Deviations in Non-Atomic Network Routing
Games},
booktitle = {Algorithmic Game Theory - 9th International Symposium, {SAGT} 2016,
Liverpool, UK, September 19-21, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9928},
pages = {129--140},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53354-3\_11},
doi = {10.1007/978-3-662-53354-3\_11},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KleerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Schafer16,
author = {Guido Sch{\"{a}}fer},
title = {Steiner Forest},
booktitle = {Encyclopedia of Algorithms},
pages = {2099--2102},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_402},
doi = {10.1007/978-1-4939-2864-4\_402},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Schafer16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KleerS16,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
title = {The Impact of Worst-Case Deviations in Non-Atomic Network Routing
Games},
journal = {CoRR},
volume = {abs/1605.01510},
year = {2016},
url = {http://arxiv.org/abs/1605.01510},
eprinttype = {arXiv},
eprint = {1605.01510},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KleerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GuptaKLRS15,
author = {Anupam Gupta and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
R. Ravi and
Guido Sch{\"{a}}fer},
title = {Efficient cost-sharing mechanisms for prize-collecting problems},
journal = {Math. Program.},
volume = {152},
number = {1-2},
pages = {147--188},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0781-1},
doi = {10.1007/S10107-014-0781-1},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/GuptaKLRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KeijzerST15,
author = {Bart de Keijzer and
Guido Sch{\"{a}}fer and
Orestis Telelis},
title = {The Strong Price of Anarchy of Linear Bottleneck Congestion Games},
journal = {Theory Comput. Syst.},
volume = {57},
number = {2},
pages = {377--396},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9598-9},
doi = {10.1007/S00224-014-9598-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KeijzerST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Anagnostopoulos15,
author = {Aris Anagnostopoulos and
Luca Becchetti and
Bart de Keijzer and
Guido Sch{\"{a}}fer},
title = {Inefficiency of Games with Social Context},
journal = {Theory Comput. Syst.},
volume = {57},
number = {3},
pages = {782--804},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9602-4},
doi = {10.1007/S00224-014-9602-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Anagnostopoulos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RahnS15,
author = {Mona Rahn and
Guido Sch{\"{a}}fer},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Efficient Equilibria in Polymatrix Coordination Games},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {529--541},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_44},
doi = {10.1007/978-3-662-48054-0\_44},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/RahnS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/15/Schafer15,
author = {Guido Sch{\"{a}}fer},
editor = {Andreas S. Schulz and
Martin Skutella and
Sebastian Stiller and
Dorothea Wagner},
title = {Budgeted Matching via the Gasoline Puzzle},
booktitle = {Gems of Combinatorial Optimization and Graph Algorithms},
pages = {49--57},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24971-1\_5},
doi = {10.1007/978-3-319-24971-1\_5},
timestamp = {Tue, 16 May 2017 14:01:43 +0200},
biburl = {https://dblp.org/rec/books/sp/15/Schafer15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wine/2015,
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6},
doi = {10.1007/978-3-662-48995-6},
isbn = {978-3-662-48994-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AptRSS15,
author = {Krzysztof R. Apt and
Mona Rahn and
Guido Sch{\"{a}}fer and
Sunil Simon},
title = {Coordination Games on Graphs},
journal = {CoRR},
volume = {abs/1501.07388},
year = {2015},
url = {http://arxiv.org/abs/1501.07388},
eprinttype = {arXiv},
eprint = {1501.07388},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AptRSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RahnS15,
author = {Mona Rahn and
Guido Sch{\"{a}}fer},
title = {Efficient Equilibria in Polymatrix Coordination Games},
journal = {CoRR},
volume = {abs/1504.07518},
year = {2015},
url = {http://arxiv.org/abs/1504.07518},
eprinttype = {arXiv},
eprint = {1504.07518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RahnS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/AptS14,
author = {Krzysztof R. Apt and
Guido Sch{\"{a}}fer},
title = {Selfishness Level of Strategic Games},
journal = {J. Artif. Intell. Res.},
volume = {49},
pages = {207--240},
year = {2014},
url = {https://doi.org/10.1613/jair.4164},
doi = {10.1613/JAIR.4164},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/AptS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/ChenKKS14,
author = {Po{-}An Chen and
Bart de Keijzer and
David Kempe and
Guido Sch{\"{a}}fer},
title = {Altruism and Its Impact on the Price of Anarchy},
journal = {{ACM} Trans. Economics and Comput.},
volume = {2},
number = {4},
pages = {17:1--17:45},
year = {2014},
url = {https://doi.org/10.1145/2597893},
doi = {10.1145/2597893},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/ChenKKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/PountourakisS14,
author = {Emmanouil Pountourakis and
Guido Sch{\"{a}}fer},
editor = {Ron Lavi},
title = {Mechanisms for Hiring a Matroid Base without Money},
booktitle = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014,
Haifa, Israel, September 30 - October 2, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8768},
pages = {255--266},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44803-8\_22},
doi = {10.1007/978-3-662-44803-8\_22},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/PountourakisS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JelinekKS14,
author = {Tomas Jelinek and
Marcus Klaas and
Guido Sch{\"{a}}fer},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {433--444},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.433},
doi = {10.4230/LIPICS.STACS.2014.433},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/JelinekKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AptRSS14,
author = {Krzysztof R. Apt and
Mona Rahn and
Guido Sch{\"{a}}fer and
Sunil Simon},
editor = {Tie{-}Yan Liu and
Qi Qi and
Yinyu Ye},
title = {Coordination Games on Graphs (Extended Abstract)},
booktitle = {Web and Internet Economics - 10th International Conference, {WINE}
2014, Beijing, China, December 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8877},
pages = {441--446},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13129-0\_37},
doi = {10.1007/978-3-319-13129-0\_37},
timestamp = {Sun, 18 Dec 2022 19:02:44 +0100},
biburl = {https://dblp.org/rec/conf/wine/AptRSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KeijzerMST13,
author = {Bart de Keijzer and
Evangelos Markakis and
Guido Sch{\"{a}}fer and
Orestis Telelis},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Inefficiency of Standard Multi-unit Auctions},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {385--396},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_33},
doi = {10.1007/978-3-642-40450-4\_33},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/KeijzerMST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AnagnostopoulosBKS13,
author = {Aris Anagnostopoulos and
Luca Becchetti and
Bart de Keijzer and
Guido Sch{\"{a}}fer},
editor = {Berthold V{\"{o}}cking},
title = {Inefficiency of Games with Social Context},
booktitle = {Algorithmic Game Theory - 6th International Symposium, {SAGT} 2013,
Aachen, Germany, October 21-23, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8146},
pages = {219--230},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41392-6\_19},
doi = {10.1007/978-3-642-41392-6\_19},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/AnagnostopoulosBKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/RahnS13,
author = {Mona Rahn and
Guido Sch{\"{a}}fer},
editor = {Yiling Chen and
Nicole Immorlica},
title = {Bounding the Inefficiency of Altruism through Social Contribution
Games},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {391--404},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_32},
doi = {10.1007/978-3-642-45046-4\_32},
timestamp = {Thu, 12 Aug 2021 18:47:48 +0200},
biburl = {https://dblp.org/rec/conf/wine/RahnS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1646,
author = {Bart de Keijzer and
Evangelos Markakis and
Guido Sch{\"{a}}fer and
Orestis Telelis},
title = {On the Inefficiency of Standard Multi-Unit Auctions},
journal = {CoRR},
volume = {abs/1303.1646},
year = {2013},
url = {http://arxiv.org/abs/1303.1646},
eprinttype = {arXiv},
eprint = {1303.1646},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1646.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RahnS13,
author = {Mona Rahn and
Guido Sch{\"{a}}fer},
title = {Bounding the Inefficiency of Altruism Through Social Contribution
Games},
journal = {CoRR},
volume = {abs/1308.2497},
year = {2013},
url = {http://arxiv.org/abs/1308.2497},
eprinttype = {arXiv},
eprint = {1308.2497},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RahnS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KeijzerS12,
author = {Bart de Keijzer and
Guido Sch{\"{a}}fer},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Finding Social Optima in Congestion Games with Positive Externalities},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {395--406},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_35},
doi = {10.1007/978-3-642-33090-2\_35},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KeijzerS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AptS12a,
author = {Krzysztof R. Apt and
Guido Sch{\"{a}}fer},
editor = {Maria J. Serna},
title = {Selfishness Level of Strategic Games},
booktitle = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
Barcelona, Spain, October 22-23, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7615},
pages = {13--24},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33996-7\_2},
doi = {10.1007/978-3-642-33996-7\_2},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/AptS12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BergerBGS11,
author = {Andr{\'{e}} Berger and
Vincenzo Bonifaci and
Fabrizio Grandoni and
Guido Sch{\"{a}}fer},
title = {Budgeted matching and budgeted matroid intersection via the gasoline
puzzle},
journal = {Math. Program.},
volume = {128},
number = {1-2},
pages = {355--372},
year = {2011},
url = {https://doi.org/10.1007/s10107-009-0307-4},
doi = {10.1007/S10107-009-0307-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BergerBGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/BuriolRRS11,
author = {Luciana S. Buriol and
Marcus Ritt and
F{\'{e}}lix Carvalho Rodrigues and
Guido Sch{\"{a}}fer},
editor = {Alberto Caprara and
Spyros C. Kontogiannis},
title = {On the Smoothed Price of Anarchy of the Traffic Assignment Problem},
booktitle = {{ATMOS} 2011 - 11th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, Saarbr{\"{u}}cken, Germany,
September 8, 2011},
series = {OASIcs},
volume = {20},
pages = {122--133},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
year = {2011},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2011.122},
doi = {10.4230/OASICS.ATMOS.2011.122},
timestamp = {Fri, 05 Apr 2024 10:04:16 +0200},
biburl = {https://dblp.org/rec/conf/atmos/BuriolRRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BonifaciSS11,
author = {Vincenzo Bonifaci and
Mahyar Salek and
Guido Sch{\"{a}}fer},
editor = {Giuseppe Persiano},
title = {Efficiency of Restricted Tolls in Non-atomic Network Routing Games},
booktitle = {Algorithmic Game Theory, 4th International Symposium, {SAGT} 2011,
Amalfi, Italy, October 17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6982},
pages = {302--313},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24829-0\_27},
doi = {10.1007/978-3-642-24829-0\_27},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/BonifaciSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/ChenKKS11,
author = {Po{-}An Chen and
Bart de Keijzer and
David Kempe and
Guido Sch{\"{a}}fer},
editor = {Ning Chen and
Edith Elkind and
Elias Koutsoupias},
title = {The Robust Price of Anarchy of Altruistic Games},
booktitle = {Internet and Network Economics - 7th International Workshop, {WINE}
2011, Singapore, December 11-14, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7090},
pages = {383--390},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25510-6\_33},
doi = {10.1007/978-3-642-25510-6\_33},
timestamp = {Fri, 24 Apr 2020 14:22:03 +0200},
biburl = {https://dblp.org/rec/conf/wine/ChenKKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2432,
author = {Krzysztof R. Apt and
Guido Sch{\"{a}}fer},
title = {Selfishness Level of Strategic Games},
journal = {CoRR},
volume = {abs/1105.2432},
year = {2011},
url = {http://arxiv.org/abs/1105.2432},
eprinttype = {arXiv},
eprint = {1105.2432},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3680,
author = {Po{-}An Chen and
Bart de Keijzer and
David Kempe and
Guido Sch{\"{a}}fer},
title = {The Robust Price of Anarchy of Altruistic Games},
journal = {CoRR},
volume = {abs/1112.3680},
year = {2011},
url = {http://arxiv.org/abs/1112.3680},
eprinttype = {arXiv},
eprint = {1112.3680},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-3680.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EisenbrandGRS10,
author = {Friedrich Eisenbrand and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Guido Sch{\"{a}}fer},
title = {Connected facility location via random facility sampling and core
detouring},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {8},
pages = {709--726},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2010.02.001},
doi = {10.1016/J.JCSS.2010.02.001},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EisenbrandGRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BonifaciHS10,
author = {Vincenzo Bonifaci and
Tobias Harks and
Guido Sch{\"{a}}fer},
title = {Stackelberg Routing in Arbitrary Networks},
journal = {Math. Oper. Res.},
volume = {35},
number = {2},
pages = {330--346},
year = {2010},
url = {https://doi.org/10.1287/moor.1100.0442},
doi = {10.1287/MOOR.1100.0442},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BonifaciHS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FleischerKLS10,
author = {Lisa Fleischer and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer},
title = {Strict Cost Sharing Schemes for Steiner Forest},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3616--3632},
year = {2010},
url = {https://doi.org/10.1137/090767108},
doi = {10.1137/090767108},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FleischerKLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BrennerS10,
author = {Janina A. Brenner and
Guido Sch{\"{a}}fer},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Online Cooperative Cost Sharing},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {252--263},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_23},
doi = {10.1007/978-3-642-13073-1\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BrennerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KeijzerST10,
author = {Bart de Keijzer and
Guido Sch{\"{a}}fer and
Orestis Telelis},
editor = {Spyros C. Kontogiannis and
Elias Koutsoupias and
Paul G. Spirakis},
title = {On the Inefficiency of Equilibria in Linear Bottleneck Congestion
Games},
booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
Athens, Greece, October 18-20, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6386},
pages = {335--346},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16170-4\_29},
doi = {10.1007/978-3-642-16170-4\_29},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KeijzerST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonemannLSZ08,
author = {Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer and
Stefan H. M. van Zwam},
title = {A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest
Game},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {5},
pages = {1319--1341},
year = {2008},
url = {https://doi.org/10.1137/050646408},
doi = {10.1137/050646408},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KonemannLSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrennerS08,
author = {Janina A. Brenner and
Guido Sch{\"{a}}fer},
title = {Group-strategyproof cost sharing mechanisms for makespan and other
scheduling problems},
journal = {Theor. Comput. Sci.},
volume = {401},
number = {1-3},
pages = {96--106},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.03.025},
doi = {10.1016/J.TCS.2008.03.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrennerS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BergerBGS08,
author = {Andr{\'{e}} Berger and
Vincenzo Bonifaci and
Fabrizio Grandoni and
Guido Sch{\"{a}}fer},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline
Puzzle},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International
Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5035},
pages = {273--287},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_19},
doi = {10.1007/978-3-540-68891-4\_19},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BergerBGS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BrennerS08,
author = {Janina A. Brenner and
Guido Sch{\"{a}}fer},
editor = {Burkhard Monien and
Ulf{-}Peter Schroeder},
title = {Singleton Acyclic Mechanisms and Their Applications to Scheduling
Problems},
booktitle = {Algorithmic Game Theory, First International Symposium, {SAGT} 2008,
Paderborn, Germany, April 30-May 2, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4997},
pages = {315--326},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79309-0\_28},
doi = {10.1007/978-3-540-79309-0\_28},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/BrennerS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandGRS08,
author = {Friedrich Eisenbrand and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Guido Sch{\"{a}}fer},
editor = {Shang{-}Hua Teng},
title = {Approximating connected facility location problems via random facility
sampling and core detouring},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1174--1183},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347210},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenbrandGRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BonifaciHS08,
author = {Vincenzo Bonifaci and
Tobias Harks and
Guido Sch{\"{a}}fer},
editor = {Christos H. Papadimitriou and
Shuzhong Zhang},
title = {Stackelberg Routing in Arbitrary Networks},
booktitle = {Internet and Network Economics, 4th International Workshop, {WINE}
2008, Shanghai, China, December 17-20, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5385},
pages = {239--250},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92185-1\_31},
doi = {10.1007/978-3-540-92185-1\_31},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/BonifaciHS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Schafer08,
author = {Guido Sch{\"{a}}fer},
editor = {Ming{-}Yang Kao},
title = {Steiner Forest},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_402},
doi = {10.1007/978-0-387-30162-4\_402},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Schafer08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KonigLMSS07,
author = {Felix G. K{\"{o}}nig and
Marco E. L{\"{u}}bbecke and
Rolf H. M{\"{o}}hring and
Guido Sch{\"{a}}fer and
Ines Spenke},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {Solutions to Real-World Instances of PSPACE-Complete Stacking},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {729--740},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_64},
doi = {10.1007/978-3-540-75520-3\_64},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KonigLMSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuptaKLRS07,
author = {Anupam Gupta and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
R. Ravi and
Guido Sch{\"{a}}fer},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {An efficient cost-sharing mechanism for the prize-collecting Steiner
forest problem},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1153--1162},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283507},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuptaKLRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BrennerS07,
author = {Janina A. Brenner and
Guido Sch{\"{a}}fer},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {Cost Sharing Methods for Makespan and Completion Time Scheduling},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {670--681},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_57},
doi = {10.1007/978-3-540-70918-3\_57},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BrennerS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BecchettiLMSV06,
author = {Luca Becchetti and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Guido Sch{\"{a}}fer and
Tjark Vredeveld},
title = {Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback
Algorithm},
journal = {Math. Oper. Res.},
volume = {31},
number = {1},
pages = {85--108},
year = {2006},
url = {https://doi.org/10.1287/moor.1050.0170},
doi = {10.1287/MOOR.1050.0170},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/BecchettiLMSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BastMST06,
author = {Hannah Bast and
Kurt Mehlhorn and
Guido Sch{\"{a}}fer and
Hisao Tamaki},
title = {Matching Algorithms Are Fast in Sparse Random Graphs},
journal = {Theory Comput. Syst.},
volume = {39},
number = {1},
pages = {3--14},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1254-y},
doi = {10.1007/S00224-005-1254-Y},
timestamp = {Mon, 14 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BastMST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FleischerKLS06,
author = {Lisa Fleischer and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer},
editor = {Jon M. Kleinberg},
title = {Simple cost sharing schemes for multicommodity rent-or-buy and stochastic
Steiner tree},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {663--670},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132609},
doi = {10.1145/1132516.1132609},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FleischerKLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SchaferS05,
author = {Guido Sch{\"{a}}fer and
Naveen Sivadasan},
title = {Topology matters: Smoothed competitiveness of metrical task systems},
journal = {Theor. Comput. Sci.},
volume = {341},
number = {1-3},
pages = {216--246},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.04.006},
doi = {10.1016/J.TCS.2005.04.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SchaferS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KonemannLSZ05,
author = {Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer and
Stefan H. M. van Zwam},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {From Primal-Dual to Cost Shares and Back: {A} Stronger {LP} Relaxation
for the Steiner Forest Problem},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {930--942},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_75},
doi = {10.1007/11523468\_75},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KonemannLSZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KonemannLS05,
author = {Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer},
title = {A group-strategyproof mechanism for Steiner forests},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {612--619},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070517},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KonemannLS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BecchettiLMSV05,
author = {Luca Becchetti and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Guido Sch{\"{a}}fer and
Tjark Vredeveld},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {Average Case and Smoothed Competitive Analysis of the Multi-Level
Feedback Algorithm},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/75},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dagstuhl/BecchettiLMSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SchaferS05,
author = {Guido Sch{\"{a}}fer and
Naveen Sivadasan},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {Topology Matters: Smoothed Competitiveness of Metrical Task Systems},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/68},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SchaferS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Schafer2004,
author = {Guido Sch{\"{a}}fer},
title = {Worst case instances are fragile: average case and smoothed competitive
analysis of algorithms},
school = {Saarland University, Saarbr{\"{u}}cken, Germany},
year = {2004},
url = {http://scidok.sulb.uni-saarland.de/volltexte/2004/334/index.html},
urn = {urn:nbn:de:bsz:291-scidok-3341},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Schafer2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeonardiS04,
author = {Stefano Leonardi and
Guido Sch{\"{a}}fer},
title = {Cross-monotonic cost sharing methods for connected facility location
games},
journal = {Theor. Comput. Sci.},
volume = {326},
number = {1-3},
pages = {431--442},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.07.033},
doi = {10.1016/J.TCS.2004.07.033},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeonardiS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/LeonardiS04,
author = {Stefano Leonardi and
Guido Sch{\"{a}}fer},
editor = {Jack S. Breese and
Joan Feigenbaum and
Margo I. Seltzer},
title = {Cross-monotonic cost-sharing methods for connected facility location
games},
booktitle = {Proceedings 5th {ACM} Conference on Electronic Commerce (EC-2004),
New York, NY, USA, May 17-20, 2004},
pages = {242--243},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/988772.988814},
doi = {10.1145/988772.988814},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/LeonardiS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BastMST04,
author = {Hannah Bast and
Kurt Mehlhorn and
Guido Sch{\"{a}}fer and
Hisao Tamaki},
editor = {Volker Diekert and
Michel Habib},
title = {Matching Algorithms Are Fast in Sparse Random Graphs},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {81--92},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_8},
doi = {10.1007/978-3-540-24749-4\_8},
timestamp = {Mon, 14 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BastMST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SchaferS04,
author = {Guido Sch{\"{a}}fer and
Naveen Sivadasan},
editor = {Volker Diekert and
Michel Habib},
title = {Topology Matters: Smoothed Competitiveness of Metrical Task Systems},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {489--500},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_43},
doi = {10.1007/978-3-540-24749-4\_43},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SchaferS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BastMS03,
author = {Hannah Bast and
Kurt Mehlhorn and
Guido Sch{\"{a}}fer},
title = {A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use
in Weighted Matching Algorithms},
journal = {Algorithmica},
volume = {36},
number = {1},
pages = {75--88},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1008-z},
doi = {10.1007/S00453-002-1008-Z},
timestamp = {Mon, 14 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BastMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BecchettiLMSV03,
author = {Luca Becchetti and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Guido Sch{\"{a}}fer and
Tjark Vredeveld},
title = {Average Case and Smoothed Competitive Analysis of the Multi-Level
Feedback Algorithm},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {462--471},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238219},
doi = {10.1109/SFCS.2003.1238219},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BecchettiLMSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/BecchettiLMS03,
author = {Luca Becchetti and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Guido Sch{\"{a}}fer},
title = {Scheduling to Minimize Flow Time Metrics},
booktitle = {17th International Parallel and Distributed Processing Symposium {(IPDPS}
2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings},
pages = {223},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/IPDPS.2003.1213410},
doi = {10.1109/IPDPS.2003.1213410},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/BecchettiLMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MehlhornPSS02,
author = {Kurt Mehlhorn and
Volker Priebe and
Guido Sch{\"{a}}fer and
Naveen Sivadasan},
title = {All-pairs shortest-paths computation in the presence of negative cycles},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {341--343},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00242-3},
doi = {10.1016/S0020-0190(01)00242-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MehlhornPSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MehlhornS02,
author = {Kurt Mehlhorn and
Guido Sch{\"{a}}fer},
title = {Implementation of O(n m log n) Weighted Matchings in General Graphs:
The Power of Data Structures},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {4},
year = {2002},
url = {https://doi.org/10.1145/944618.944622},
doi = {10.1145/944618.944622},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MehlhornS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MehlhornS01,
author = {Kurt Mehlhorn and
Guido Sch{\"{a}}fer},
editor = {Friedhelm Meyer auf der Heide},
title = {A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use
in Weighted Matching Algorithms},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {242--253},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_20},
doi = {10.1007/3-540-44676-1\_20},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MehlhornS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/MehlhornS00,
author = {Kurt Mehlhorn and
Guido Sch{\"{a}}fer},
editor = {Stefan N{\"{a}}her and
Dorothea Wagner},
title = {Implementation of {O} (nm log n) Weighted Matchings in General Graphs.
The Power of Data Structures},
booktitle = {Algorithm Engineering, 4th International Workshop, {WAE} 2000, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1982},
pages = {23--38},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44691-5\_3},
doi = {10.1007/3-540-44691-5\_3},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/MehlhornS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FrigioniMNPSZ98,
author = {Daniele Frigioni and
Tobias Miller and
Umberto Nanni and
Giulio Pasqualone and
Guido Sch{\"{a}}fer and
Christos D. Zaroliagis},
editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
title = {An Experimental Study of Dynamic Algorithms for Directed Graphs},
booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1461},
pages = {368--380},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68530-8\_31},
doi = {10.1007/3-540-68530-8\_31},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FrigioniMNPSZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-07 22:25 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:
