Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel. On Sparsification of Stochastic Packing Problems. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 51:1-51:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dughmi_et_al:LIPIcs.ICALP.2023.51, author = {Dughmi, Shaddin and Kalayci, Yusuf Hakan and Patel, Neel}, title = {{On Sparsification of Stochastic Packing Problems}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {51:1--51:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.51}, URN = {urn:nbn:de:0030-drops-181036}, doi = {10.4230/LIPIcs.ICALP.2023.51}, annote = {Keywords: Stochastic packing, sparsification, matroid} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, and Konstantin Zabarnyi. Multi-Channel Bayesian Persuasion. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 11:1-11:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{babichenko_et_al:LIPIcs.ITCS.2022.11, author = {Babichenko, Yakov and Talgam-Cohen, Inbal and Xu, Haifeng and Zabarnyi, Konstantin}, title = {{Multi-Channel Bayesian Persuasion}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {11:1--11:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.11}, URN = {urn:nbn:de:0030-drops-156072}, doi = {10.4230/LIPIcs.ITCS.2022.11}, annote = {Keywords: Algorithmic game theory, Bayesian persuasion, Private Bayesian persuasion, Public Bayesian persuasion, Secret sharing, Networks} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Shaddin Dughmi. Matroid Secretary Is Equivalent to Contention Resolution. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 58:1-58:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dughmi:LIPIcs.ITCS.2022.58, author = {Dughmi, Shaddin}, title = {{Matroid Secretary Is Equivalent to Contention Resolution}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {58:1--58:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.58}, URN = {urn:nbn:de:0030-drops-156540}, doi = {10.4230/LIPIcs.ITCS.2022.58}, annote = {Keywords: Contention Resolution, Secretary Problems, Matroids} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Curtis Bechtel and Shaddin Dughmi. Delegated Stochastic Probing. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 37:1-37:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bechtel_et_al:LIPIcs.ITCS.2021.37, author = {Bechtel, Curtis and Dughmi, Shaddin}, title = {{Delegated Stochastic Probing}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {37:1--37:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.37}, URN = {urn:nbn:de:0030-drops-135763}, doi = {10.4230/LIPIcs.ITCS.2021.37}, annote = {Keywords: Delegation, Mechanism Design, Algorithmic Game Theory} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Shaddin Dughmi. The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dughmi:LIPIcs.ICALP.2020.42, author = {Dughmi, Shaddin}, title = {{The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {42:1--42: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.42}, URN = {urn:nbn:de:0030-drops-124496}, doi = {10.4230/LIPIcs.ICALP.2020.42}, annote = {Keywords: Contention Resolution, Secretary Problems, Matroids} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Shaddin Dughmi, David Kempe, and Ruixin Qiang. Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dughmi_et_al:LIPIcs.ITCS.2019.31, author = {Dughmi, Shaddin and Kempe, David and Qiang, Ruixin}, title = {{Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.31}, URN = {urn:nbn:de:0030-drops-101248}, doi = {10.4230/LIPIcs.ITCS.2019.31}, annote = {Keywords: Interim rule, order sampling, virtual value function, Border's theorem} }
Feedback for Dagstuhl Publishing