Published in: LIPIcs, Volume 305, 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
Alexis de Colnet. On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF. In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 305, pp. 11:1-11:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{decolnet:LIPIcs.SAT.2024.11, author = {de Colnet, Alexis}, title = {{On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF}}, booktitle = {27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)}, pages = {11:1--11:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-334-8}, ISSN = {1868-8969}, year = {2024}, volume = {305}, editor = {Chakraborty, Supratik and Jiang, Jie-Hong Roland}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.11}, URN = {urn:nbn:de:0030-drops-205339}, doi = {10.4230/LIPIcs.SAT.2024.11}, annote = {Keywords: Knowledge compilation, top-down compilation, decision-DNNF Circuits} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Yuda Feng and Shi Li. A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 63:1-63:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{feng_et_al:LIPIcs.ICALP.2024.63, author = {Feng, Yuda and Li, Shi}, title = {{A Note on Approximating Weighted Nash Social Welfare with Additive Valuations}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {63:1--63:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.63}, URN = {urn:nbn:de:0030-drops-202068}, doi = {10.4230/LIPIcs.ICALP.2024.63}, annote = {Keywords: Nash Social Welfare, Configuration LP, Approximation Algorithms} }
Published in: Dagstuhl Reports, Volume 4, Issue 5 (2014)
Franz Dietrich, Ulle Endriss, Davide Grossi, Gabriella Pigozzi, and Marija Slavkovik. JA4AI – Judgment Aggregation for Artificial Intelligence (Dagstuhl Seminar 14202). In Dagstuhl Reports, Volume 4, Issue 5, pp. 27-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Article{dietrich_et_al:DagRep.4.5.27, author = {Dietrich, Franz and Endriss, Ulle and Grossi, Davide and Pigozzi, Gabriella and Slavkovik, Marija}, title = {{JA4AI – Judgment Aggregation for Artificial Intelligence (Dagstuhl Seminar 14202)}}, pages = {27--39}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2014}, volume = {4}, number = {5}, editor = {Dietrich, Franz and Endriss, Ulle and Grossi, Davide and Pigozzi, Gabriella and Slavkovik, Marija}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.5.27}, URN = {urn:nbn:de:0030-drops-46791}, doi = {10.4230/DagRep.4.5.27}, annote = {Keywords: Judgment Aggregation, Artificial Intelligence, Computational Social Choice, Collective Decision-making} }
Published in: Dagstuhl Seminar Proceedings, Volume 7431, Computational Issues in Social Choice (2007)
Ulle Endriss, Jérôme Lang, Francesca Rossi, and Tuomas Sandholm. 07431 Abstracts Collection – Computational Issues in Social Choice. In Computational Issues in Social Choice. Dagstuhl Seminar Proceedings, Volume 7431, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{endriss_et_al:DagSemProc.07431.1, author = {Endriss, Ulle and Lang, J\'{e}r\^{o}me and Rossi, Francesca and Sandholm, Tuomas}, title = {{07431 Abstracts Collection – Computational Issues in Social Choice}}, booktitle = {Computational Issues in Social Choice}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7431}, editor = {Ulle Endriss and J\'{e}r\^{o}me Lang and Francesca Rossi 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.07431.1}, URN = {urn:nbn:de:0030-drops-12736}, doi = {10.4230/DagSemProc.07431.1}, annote = {Keywords: Computational social choice, voting theory, fair division, mechanism design, coalition formation, complexity theory, preference representation, algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 7431, Computational Issues in Social Choice (2007)
Ulle Endriss, Jérôme Lang, Francesca Rossi, and Tuomas Sandholm. 07431 Executive Summary – Computational Issues in Social Choice. In Computational Issues in Social Choice. Dagstuhl Seminar Proceedings, Volume 7431, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{endriss_et_al:DagSemProc.07431.2, author = {Endriss, Ulle and Lang, J\'{e}r\^{o}me and Rossi, Francesca and Sandholm, Tuomas}, title = {{07431 Executive Summary – Computational Issues in Social Choice}}, booktitle = {Computational Issues in Social Choice}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7431}, editor = {Ulle Endriss and J\'{e}r\^{o}me Lang and Francesca Rossi 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.07431.2}, URN = {urn:nbn:de:0030-drops-12749}, doi = {10.4230/DagSemProc.07431.2}, annote = {Keywords: Computational social choice, voting theory, fair division, mechanism design, coalition formation, complexity theory, preference representation, algorithms} }
Feedback for Dagstuhl Publishing