Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, and Patrick A. Phillips. Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 57:1-57:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hemaspaandra_et_al:LIPIcs.MFCS.2022.57, author = {Hemaspaandra, Lane A. and Juvekar, Mandar and Nadjimzadah, Arian and Phillips, Patrick A.}, title = {{Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.57}, URN = {urn:nbn:de:0030-drops-168552}, doi = {10.4230/LIPIcs.MFCS.2022.57}, annote = {Keywords: structural complexity theory, computational complexity theory, ambiguity-limited NP, counting classes, P-printable sets} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, and David Wehner. Finding Optimal Solutions With Neighborly Help. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 78:1-78:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{burjons_et_al:LIPIcs.MFCS.2019.78, author = {Burjons, Elisabet and Frei, Fabian and Hemaspaandra, Edith and Komm, Dennis and Wehner, David}, title = {{Finding Optimal Solutions With Neighborly Help}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {78:1--78:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.78}, URN = {urn:nbn:de:0030-drops-110221}, doi = {10.4230/LIPIcs.MFCS.2019.78}, annote = {Keywords: Critical Graphs, Computational Complexity, Structural Self-Reducibility, Minimality Problems, Colorability, Vertex Cover, Satisfiability, Reoptimization, Advice} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, and Osamu Watanabe. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hemaspaandra_et_al:LIPIcs.MFCS.2018.51, author = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Spakowski, Holger and Watanabe, Osamu}, title = {{The Robustness of LWPP and WPP, with an Application to Graph Reconstruction}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.51}, URN = {urn:nbn:de:0030-drops-96330}, doi = {10.4230/LIPIcs.MFCS.2018.51}, annote = {Keywords: structural complexity theory, robustness of counting classes, the legitimate deck problem, PP-lowness, the Reconstruction Conjecture} }
Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Edith Hemaspaandra, Lane A. Hemaspaandra, and Curtis Menton. Search versus Decision for Election Manipulation Problems. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 377-388, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{hemaspaandra_et_al:LIPIcs.STACS.2013.377, author = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Menton, Curtis}, title = {{Search versus Decision for Election Manipulation Problems}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {377--388}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.377}, URN = {urn:nbn:de:0030-drops-39498}, doi = {10.4230/LIPIcs.STACS.2013.377}, annote = {Keywords: Search vs. decision, application of structural complexity theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)
Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-Francois Laslier, and William S. Zwicker. 10101 Abstracts Collection – Computational Foundations of Social Choice. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brandt_et_al:DagSemProc.10101.1, author = {Brandt, Felix and Conitzer, Vincent and Hemaspaandra, Lane A. and Laslier, Jean-Francois and Zwicker, William S.}, title = {{10101 Abstracts Collection – Computational Foundations of Social Choice}}, booktitle = {Computational Foundations of Social Choice}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10101}, editor = {Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.1}, URN = {urn:nbn:de:0030-drops-25644}, doi = {10.4230/DagSemProc.10101.1}, annote = {Keywords: Social Choice Theory, Voting, Fair Division, Algorithms, Computational Complexity, Multiagent Systems} }
Published in: Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)
Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-Francois Laslier, and William S. Zwicker. 10101 Executive Summary – Computational Foundations of Social Choice. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brandt_et_al:DagSemProc.10101.2, author = {Brandt, Felix and Conitzer, Vincent and Hemaspaandra, Lane A. and Laslier, Jean-Francois and Zwicker, William S.}, title = {{10101 Executive Summary – Computational Foundations of Social Choice}}, booktitle = {Computational Foundations of Social Choice}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10101}, editor = {Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.2}, URN = {urn:nbn:de:0030-drops-25637}, doi = {10.4230/DagSemProc.10101.2}, annote = {Keywords: Social Choice Theory, Voting, Fair Division, Algorithms, Computational Complexity, Multiagent Systems} }
Published in: Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)
Makoto Yokoo. False-name-Proof Combinatorial Auction Mechanisms. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{yokoo:DagSemProc.10101.3, author = {Yokoo, Makoto}, title = {{False-name-Proof Combinatorial Auction Mechanisms}}, booktitle = {Computational Foundations of Social Choice}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10101}, editor = {Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.3}, URN = {urn:nbn:de:0030-drops-25621}, doi = {10.4230/DagSemProc.10101.3}, annote = {Keywords: Combinatorial auctions, mechanism design, false-name bids} }
Published in: Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)
Toby Walsh. Manipulability of Single Transferable Vote. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{walsh:DagSemProc.10101.4, author = {Walsh, Toby}, title = {{Manipulability of Single Transferable Vote}}, booktitle = {Computational Foundations of Social Choice}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10101}, editor = {Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.4}, URN = {urn:nbn:de:0030-drops-25585}, doi = {10.4230/DagSemProc.10101.4}, annote = {Keywords: Computational social choice, manipulability, STV voting, NP-hardness} }
Published in: Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)
Alon Altman, Ariel D. Procaccia, and Moshe Tennenholtz. Nonmanipulable Selections from a Tournament. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{altman_et_al:DagSemProc.10101.5, author = {Altman, Alon and Procaccia, Ariel D. and Tennenholtz, Moshe}, title = {{Nonmanipulable Selections from a Tournament}}, booktitle = {Computational Foundations of Social Choice}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10101}, editor = {Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.5}, URN = {urn:nbn:de:0030-drops-25607}, doi = {10.4230/DagSemProc.10101.5}, annote = {Keywords: Tournament, manipulation} }
Published in: Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)
Vincent Merlin, Mostapha Diss, Ahmed Louichi, and Hatem Smaoui. On the stability of a scoring rules set under the IAC. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{merlin_et_al:DagSemProc.10101.6, author = {Merlin, Vincent and Diss, Mostapha and Louichi, Ahmed and Smaoui, Hatem}, title = {{On the stability of a scoring rules set under the IAC}}, booktitle = {Computational Foundations of Social Choice}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10101}, editor = {Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.6}, URN = {urn:nbn:de:0030-drops-25610}, doi = {10.4230/DagSemProc.10101.6}, annote = {Keywords: Self-selectivity, Stability, Consequentialism, Ehrhart polynomials} }
Feedback for Dagstuhl Publishing