Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre. Strong Approximations and Irrationality in Financial Networks with Derivatives. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 76:1-76:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ioannidis_et_al:LIPIcs.ICALP.2022.76, author = {Ioannidis, Stavros D. and de Keijzer, Bart and Ventre, Carmine}, title = {{Strong Approximations and Irrationality in Financial Networks with Derivatives}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {76:1--76:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.76}, URN = {urn:nbn:de:0030-drops-164172}, doi = {10.4230/LIPIcs.ICALP.2022.76}, annote = {Keywords: FIXP, Financial Networks, Systemic Risk} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Bart de Keijzer, Maria Kyropoulou, and Carmine Ventre. Obviously Strategyproof Single-Minded Combinatorial Auctions. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 71:1-71:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dekeijzer_et_al:LIPIcs.ICALP.2020.71, author = {de Keijzer, Bart and Kyropoulou, Maria and Ventre, Carmine}, title = {{Obviously Strategyproof Single-Minded Combinatorial Auctions}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {71:1--71:17}, 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.71}, URN = {urn:nbn:de:0030-drops-124781}, doi = {10.4230/LIPIcs.ICALP.2020.71}, annote = {Keywords: OSP Mechanisms, Extensive-form Mechanisms, Single-minded Combinatorial Auctions, Greedy algorithms} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Irving van Heuven van Staereling, Bart de Keijzer, and Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 50:1-50:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{vanheuvenvanstaereling_et_al:LIPIcs.MFCS.2016.50, author = {van Heuven van Staereling, Irving and de Keijzer, Bart and Sch\"{a}fer, Guido}, title = {{The Ground-Set-Cost Budgeted Maximum Coverage Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.50}, URN = {urn:nbn:de:0030-drops-65020}, doi = {10.4230/LIPIcs.MFCS.2016.50}, annote = {Keywords: maximum coverage problem, approximation algorithms, hypergraphs, submodular optimization, sponsored search} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Haris Aziz and Bart de Keijzer. Shapley meets Shapley. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 99-111, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{aziz_et_al:LIPIcs.STACS.2014.99, author = {Aziz, Haris and de Keijzer, Bart}, title = {{Shapley meets Shapley}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {99--111}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.99}, URN = {urn:nbn:de:0030-drops-44504}, doi = {10.4230/LIPIcs.STACS.2014.99}, annote = {Keywords: matching games, Shapley, counting complexity} }
Feedback for Dagstuhl Publishing