Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Jason Hartline and Aleck Johnsen. Equivocal Blends: Prior Independent Lower Bounds. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 59:1-59:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hartline_et_al:LIPIcs.ITCS.2024.59, author = {Hartline, Jason and Johnsen, Aleck}, title = {{Equivocal Blends: Prior Independent Lower Bounds}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {59:1--59:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.59}, URN = {urn:nbn:de:0030-drops-195878}, doi = {10.4230/LIPIcs.ITCS.2024.59}, annote = {Keywords: prior independent algorithms, lower bounds, correlated decompositions, minimax, equivocal blends, mechanism design, blackwell ordering} }
Published in: LIPIcs, Volume 256, 4th Symposium on Foundations of Responsible Computing (FORC 2023)
Hedyeh Beyhaghi, Modibo K. Camara, Jason Hartline, Aleck Johnsen, and Sheng Long. Screening with Disadvantaged Agents. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 256, pp. 6:1-6:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{beyhaghi_et_al:LIPIcs.FORC.2023.6, author = {Beyhaghi, Hedyeh and Camara, Modibo K. and Hartline, Jason and Johnsen, Aleck and Long, Sheng}, title = {{Screening with Disadvantaged Agents}}, booktitle = {4th Symposium on Foundations of Responsible Computing (FORC 2023)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-272-3}, ISSN = {1868-8969}, year = {2023}, volume = {256}, editor = {Talwar, Kunal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2023.6}, URN = {urn:nbn:de:0030-drops-179274}, doi = {10.4230/LIPIcs.FORC.2023.6}, annote = {Keywords: screening, strategic classification, budgeted mechanism design, fairness, effort-incentives, subsidies, school admission} }
Published in: LIPIcs, Volume 256, 4th Symposium on Foundations of Responsible Computing (FORC 2023)
Jiale Chen, Jason Hartline, and Onno Zoeter. Fair Grading Algorithms for Randomized Exams. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 256, pp. 7:1-7:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chen_et_al:LIPIcs.FORC.2023.7, author = {Chen, Jiale and Hartline, Jason and Zoeter, Onno}, title = {{Fair Grading Algorithms for Randomized Exams}}, booktitle = {4th Symposium on Foundations of Responsible Computing (FORC 2023)}, pages = {7:1--7:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-272-3}, ISSN = {1868-8969}, year = {2023}, volume = {256}, editor = {Talwar, Kunal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2023.7}, URN = {urn:nbn:de:0030-drops-179282}, doi = {10.4230/LIPIcs.FORC.2023.7}, annote = {Keywords: Ex-ante and Ex-post Fairness, Item Response Theory, Algorithmic Fairness in Education} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Giorgos Christodoulou, Vasilis Gkatzelis, and Daniel Schoepflin. Optimal Deterministic Clock Auctions and Beyond. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 49:1-49:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{christodoulou_et_al:LIPIcs.ITCS.2022.49, author = {Christodoulou, Giorgos and Gkatzelis, Vasilis and Schoepflin, Daniel}, title = {{Optimal Deterministic Clock Auctions and Beyond}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {49:1--49: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.49}, URN = {urn:nbn:de:0030-drops-156453}, doi = {10.4230/LIPIcs.ITCS.2022.49}, annote = {Keywords: Auctions, Obvious Strategyproofness, Mechanism Design} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Moshe Babaioff, Richard Cole, Jason Hartline, Nicole Immorlica, and Brendan Lucier. Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract). In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, p. 84:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{babaioff_et_al:LIPIcs.ITCS.2021.84, author = {Babaioff, Moshe and Cole, Richard and Hartline, Jason and Immorlica, Nicole and Lucier, Brendan}, title = {{Non-Quasi-Linear Agents in Quasi-Linear Mechanisms}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {84:1--84:1}, 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.84}, URN = {urn:nbn:de:0030-drops-136230}, doi = {10.4230/LIPIcs.ITCS.2021.84}, annote = {Keywords: Return on investment, Non-quasi-linear agents, Transferable Welfare, Simultaneous Second-Price Auctions} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger. Welfare Maximization with Friends-of-Friends Network Externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 90-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bhattacharya_et_al:LIPIcs.STACS.2015.90, author = {Bhattacharya, Sayan and Dvor\'{a}k, Wolfgang and Henzinger, Monika and Starnberger, Martin}, title = {{Welfare Maximization with Friends-of-Friends Network Externalities}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {90--102}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.90}, URN = {urn:nbn:de:0030-drops-49066}, doi = {10.4230/LIPIcs.STACS.2015.90}, annote = {Keywords: network externalities, welfare maximization, approximation algorithms} }
Feedback for Dagstuhl Publishing