Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Martin Bullinger. Boundaries to Single-Agent Stability in Additively Separable Hedonic Games. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bullinger:LIPIcs.MFCS.2022.26, author = {Bullinger, Martin}, title = {{Boundaries to Single-Agent Stability in Additively Separable Hedonic Games}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {26:1--26: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.26}, URN = {urn:nbn:de:0030-drops-168249}, doi = {10.4230/LIPIcs.MFCS.2022.26}, annote = {Keywords: Coalition Formation, Hedonic Games, Stability} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Felix Brandt. Computational Social Choice (Tutorial). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, p. 19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{brandt:LIPIcs.STACS.2015.19, author = {Brandt, Felix}, title = {{Computational Social Choice}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {19--19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.19}, URN = {urn:nbn:de:0030-drops-49593}, doi = {10.4230/LIPIcs.STACS.2015.19}, annote = {Keywords: social choice theory, economics, algorithms, 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} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Felix Brandt, Felix Fischer, and Markus Holzer. On Iterated Dominance, Matrix Elimination, and Matched Paths. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 107-118, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brandt_et_al:LIPIcs.STACS.2010.2448, author = {Brandt, Felix and Fischer, Felix and Holzer, Markus}, title = {{On Iterated Dominance, Matrix Elimination, and Matched Paths}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {107--118}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, 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.2010.2448}, URN = {urn:nbn:de:0030-drops-24485}, doi = {10.4230/LIPIcs.STACS.2010.2448}, annote = {Keywords: Algorithmic Game Theory, Computational Complexity, Iterated Dominance, Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Felix Brandt, Tuomas Sandholm, and Yoav Shoham. Spiteful Bidding in Sealed-Bid Auctions. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{brandt_et_al:DagSemProc.05011.17, author = {Brandt, Felix and Sandholm, Tuomas and Shoham, Yoav}, title = {{Spiteful Bidding in Sealed-Bid Auctions}}, booktitle = {Computing and Markets}, pages = {1--16}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.17}, URN = {urn:nbn:de:0030-drops-1987}, doi = {10.4230/DagSemProc.05011.17}, annote = {Keywords: Auctions , Externalities , Spite , Revenue} }
Feedback for Dagstuhl Publishing