Published in: Dagstuhl Reports, Volume 12, Issue 5 (2022)
Martin Gairing, Carolina Osorio, Britta Peis, David Watling, and Katharina Eickhoff. Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192). In Dagstuhl Reports, Volume 12, Issue 5, pp. 92-111, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{gairing_et_al:DagRep.12.5.92, author = {Gairing, Martin and Osorio, Carolina and Peis, Britta and Watling, David and Eickhoff, Katharina}, title = {{Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192)}}, pages = {92--111}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {5}, editor = {Gairing, Martin and Osorio, Carolina and Peis, Britta and Watling, David and Eickhoff, Katharina}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.5.92}, URN = {urn:nbn:de:0030-drops-174441}, doi = {10.4230/DagRep.12.5.92}, annote = {Keywords: Algorithms and Complexity of traffic equilibrium computations, Dynamic traffic assignment models, Simulation and network optimization} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, and Clara Waldmann. Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 32:1-32:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{christodoulou_et_al:LIPIcs.ICALP.2020.32, author = {Christodoulou, George and Gairing, Martin and Giannakopoulos, Yiannis and Po\c{c}as, Diogo and Waldmann, Clara}, title = {{Existence and Complexity of Approximate Equilibria in Weighted Congestion Games}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.32}, URN = {urn:nbn:de:0030-drops-124392}, doi = {10.4230/LIPIcs.ICALP.2020.32}, annote = {Keywords: Atomic congestion games, existence of equilibria, pure Nash equilibria, approximate equilibria, hardness of equilibria} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani. Reachability Switching Games. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 124:1-124:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fearnley_et_al:LIPIcs.ICALP.2018.124, author = {Fearnley, John and Gairing, Martin and Mnich, Matthias and Savani, Rahul}, title = {{Reachability Switching Games}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {124:1--124:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.124}, URN = {urn:nbn:de:0030-drops-91282}, doi = {10.4230/LIPIcs.ICALP.2018.124}, annote = {Keywords: Deterministic Random Walks, Model Checking, Reachability, Simple Stochastic Game, Switching Systems} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, and Paul G. Spirakis. The Price of Stability of Weighted Congestion Games. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 150:1-150:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{christodoulou_et_al:LIPIcs.ICALP.2018.150, author = {Christodoulou, George and Gairing, Martin and Giannakopoulos, Yiannis and Spirakis, Paul G.}, title = {{The Price of Stability of Weighted Congestion Games}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {150:1--150:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.150}, URN = {urn:nbn:de:0030-drops-91541}, doi = {10.4230/LIPIcs.ICALP.2018.150}, annote = {Keywords: Congestion games, price of stability, Nash equilibrium, approximate equilibrium, potential games} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
George Christodoulou, Martin Gairing, Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul Spirakis. Strategic Contention Resolution with Limited Feedback. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 30:1-30:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{christodoulou_et_al:LIPIcs.ESA.2016.30, author = {Christodoulou, George and Gairing, Martin and Nikoletseas, Sotiris and Raptopoulos, Christoforos and Spirakis, Paul}, title = {{Strategic Contention Resolution with Limited Feedback}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.30}, URN = {urn:nbn:de:0030-drops-63813}, doi = {10.4230/LIPIcs.ESA.2016.30}, annote = {Keywords: contention resolution, acknowledgment-based protocols, game theory} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Martin Gairing, Tobias Harks, and Max Klimm. Complexity and Approximation of the Continuous Network Design Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 226-241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{gairing_et_al:LIPIcs.APPROX-RANDOM.2014.226, author = {Gairing, Martin and Harks, Tobias and Klimm, Max}, title = {{Complexity and Approximation of the Continuous Network Design Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {226--241}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.226}, URN = {urn:nbn:de:0030-drops-46998}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.226}, annote = {Keywords: Bilevel optimization, Optimization under equilibrium constraints, Network design, Wardrop equilibrium, Computational complexity, Approximation algorit} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, and Burkhard Monien. The Price of Anarchy for Polynomial Social Cost. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2005)
@InProceedings{gairing_et_al:DagSemProc.05011.19, author = {Gairing, Martin and L\"{u}cking, Thomas and Mavronicolas, Marios and Monien, Burkhard}, title = {{The Price of Anarchy for Polynomial Social Cost}}, booktitle = {Computing and Markets}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.19}, URN = {urn:nbn:de:0030-drops-2005}, doi = {10.4230/DagSemProc.05011.19}, annote = {Keywords: selfish routing , KP-model , price of anarchy , fully mixed Nash Equilibrium} }
Feedback for Dagstuhl Publishing