BibTeX records: Benjamin Plaut

download as .bib file

@article{DBLP:journals/corr/abs-2402-08062,
  author       = {Benjamin Plaut and
                  Hanlin Zhu and
                  Stuart Russell},
  title        = {Avoiding Catastrophe in Continuous Spaces by Asking for Help},
  journal      = {CoRR},
  volume       = {abs/2402.08062},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.08062},
  doi          = {10.48550/ARXIV.2402.08062},
  eprinttype    = {arXiv},
  eprint       = {2402.08062},
  timestamp    = {Mon, 19 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-08062.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2402-13213,
  author       = {Benjamin Plaut and
                  Khanh Nguyen and
                  Tu Trinh},
  title        = {Softmax Probabilities (Mostly) Predict Large Language Model Correctness
                  on Multiple-Choice Q{\&}A},
  journal      = {CoRR},
  volume       = {abs/2402.13213},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.13213},
  doi          = {10.48550/ARXIV.2402.13213},
  eprinttype    = {arXiv},
  eprint       = {2402.13213},
  timestamp    = {Thu, 21 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-13213.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/us/Plaut21,
  author       = {Benjamin Plaut},
  title        = {Algorithms for fair public and private resource allocation},
  school       = {Stanford University, {USA}},
  year         = {2021},
  url          = {https://searchworks.stanford.edu/view/13972873},
  timestamp    = {Fri, 02 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/Plaut21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/scw/GargGP21,
  author       = {Nikhil Garg and
                  Ashish Goel and
                  Benjamin Plaut},
  title        = {Markets for public decision-making},
  journal      = {Soc. Choice Welf.},
  volume       = {56},
  number       = {4},
  pages        = {755--801},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00355-020-01298-4},
  doi          = {10.1007/S00355-020-01298-4},
  timestamp    = {Tue, 09 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scw/GargGP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/PlautR20,
  author       = {Benjamin Plaut and
                  Tim Roughgarden},
  title        = {Communication Complexity of Discrete Fair Division},
  journal      = {{SIAM} J. Comput.},
  volume       = {49},
  number       = {1},
  pages        = {206--243},
  year         = {2020},
  url          = {https://doi.org/10.1137/19M1244305},
  doi          = {10.1137/19M1244305},
  timestamp    = {Wed, 11 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PlautR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/PlautR20,
  author       = {Benjamin Plaut and
                  Tim Roughgarden},
  title        = {Almost Envy-Freeness with General Valuations},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {34},
  number       = {2},
  pages        = {1039--1068},
  year         = {2020},
  url          = {https://doi.org/10.1137/19M124397X},
  doi          = {10.1137/19M124397X},
  timestamp    = {Thu, 06 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/PlautR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wine/GollapudiKP20,
  author       = {Sreenivas Gollapudi and
                  Kostas Kollias and
                  Benjamin Plaut},
  editor       = {Xujin Chen and
                  Nikolai Gravin and
                  Martin Hoefer and
                  Ruta Mehta},
  title        = {Almost Envy-Free Repeated Matching in Two-Sided Markets},
  booktitle    = {Web and Internet Economics - 16th International Conference, {WINE}
                  2020, Beijing, China, December 7-11, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12495},
  pages        = {3--16},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-64946-3\_1},
  doi          = {10.1007/978-3-030-64946-3\_1},
  timestamp    = {Fri, 26 Mar 2021 08:28:34 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/GollapudiKP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wine/Plaut20,
  author       = {Benjamin Plaut},
  editor       = {Xujin Chen and
                  Nikolai Gravin and
                  Martin Hoefer and
                  Ruta Mehta},
  title        = {Optimal Nash Equilibria for Bandwidth Allocation},
  booktitle    = {Web and Internet Economics - 16th International Conference, {WINE}
                  2020, Beijing, China, December 7-11, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12495},
  pages        = {77--88},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-64946-3\_6},
  doi          = {10.1007/978-3-030-64946-3\_6},
  timestamp    = {Wed, 09 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/Plaut20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wine/GoelP20,
  author       = {Ashish Goel and
                  Benjamin Plaut},
  editor       = {Xujin Chen and
                  Nikolai Gravin and
                  Martin Hoefer and
                  Ruta Mehta},
  title        = {Counteracting Inequality in Markets via Convex Pricing},
  booktitle    = {Web and Internet Economics - 16th International Conference, {WINE}
                  2020, Beijing, China, December 7-11, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12495},
  pages        = {89--101},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-64946-3\_7},
  doi          = {10.1007/978-3-030-64946-3\_7},
  timestamp    = {Wed, 09 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/GoelP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2009-09336,
  author       = {Sreenivas Gollapudi and
                  Kostas Kollias and
                  Benjamin Plaut},
  title        = {Almost Envy-free Repeated Matching in Two-sided Markets},
  journal      = {CoRR},
  volume       = {abs/2009.09336},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.09336},
  eprinttype    = {arXiv},
  eprint       = {2009.09336},
  timestamp    = {Wed, 23 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-09336.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2009-09351,
  author       = {Ashish Goel and
                  Benjamin Plaut},
  title        = {Counteracting Inequality in Markets via Convex Pricing},
  journal      = {CoRR},
  volume       = {abs/2009.09351},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.09351},
  eprinttype    = {arXiv},
  eprint       = {2009.09351},
  timestamp    = {Wed, 23 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-09351.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/PlautR19,
  author       = {Benjamin Plaut and
                  Tim Roughgarden},
  editor       = {Timothy M. Chan},
  title        = {Communication Complexity of Discrete Fair Division},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {2014--2033},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.122},
  doi          = {10.1137/1.9781611975482.122},
  timestamp    = {Thu, 15 Jul 2021 13:49:01 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/PlautR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wine/GoelHP19,
  author       = {Ashish Goel and
                  Reyna Hulett and
                  Benjamin Plaut},
  editor       = {Ioannis Caragiannis and
                  Vahab S. Mirrokni and
                  Evdokia Nikolova},
  title        = {Markets Beyond Nash Welfare for Leontief Utilities},
  booktitle    = {Web and Internet Economics - 15th International Conference, {WINE}
                  2019, New York, NY, USA, December 10-12, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11920},
  pages        = {340},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://link.springer.com/content/pdf/bbm\%3A978-3-030-35389-6\%2F1.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/GoelHP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wine/ImmorlicaPW19,
  author       = {Nicole Immorlica and
                  Benjamin Plaut and
                  E. Glen Weyl},
  editor       = {Ioannis Caragiannis and
                  Vahab S. Mirrokni and
                  Evdokia Nikolova},
  title        = {Equality of Power and Fair Public Decision-Making},
  booktitle    = {Web and Internet Economics - 15th International Conference, {WINE}
                  2019, New York, NY, USA, December 10-12, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11920},
  pages        = {342},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://link.springer.com/content/pdf/bbm\%3A978-3-030-35389-6\%2F1.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/ImmorlicaPW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1904-03322,
  author       = {Benjamin Plaut},
  title        = {Optimal Nash Equilibria for Bandwidth Allocation},
  journal      = {CoRR},
  volume       = {abs/1904.03322},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.03322},
  eprinttype    = {arXiv},
  eprint       = {1904.03322},
  timestamp    = {Wed, 24 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-03322.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/PlautR18,
  author       = {Benjamin Plaut and
                  Tim Roughgarden},
  editor       = {Artur Czumaj},
  title        = {Almost Envy-Freeness with General Valuations},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {2584--2603},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.165},
  doi          = {10.1137/1.9781611975031.165},
  timestamp    = {Tue, 02 Feb 2021 17:07:58 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/PlautR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wine/GargGP18,
  author       = {Nikhil Garg and
                  Ashish Goel and
                  Benjamin Plaut},
  editor       = {George Christodoulou and
                  Tobias Harks},
  title        = {Markets for Public Decision-Making},
  booktitle    = {Web and Internet Economics - 14th International Conference, {WINE}
                  2018, Oxford, UK, December 15-17, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11316},
  pages        = {445},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://link.springer.com/content/pdf/bbm\%3A978-3-030-04612-5\%2F1.pdf},
  timestamp    = {Tue, 09 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/GargGP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1807-05293,
  author       = {Ashish Goel and
                  Reyna Hulett and
                  Benjamin Plaut},
  title        = {Markets Beyond Nash Welfare for Leontief Utilities},
  journal      = {CoRR},
  volume       = {abs/1807.05293},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.05293},
  eprinttype    = {arXiv},
  eprint       = {1807.05293},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-05293.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1807-10836,
  author       = {Nikhil Garg and
                  Ashish Goel and
                  Benjamin Plaut},
  title        = {Markets for Public Decision-making},
  journal      = {CoRR},
  volume       = {abs/1807.10836},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.10836},
  eprinttype    = {arXiv},
  eprint       = {1807.10836},
  timestamp    = {Tue, 09 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-10836.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/PlautR17,
  author       = {Benjamin Plaut and
                  Tim Roughgarden},
  title        = {Almost Envy-Freeness with General Valuations},
  journal      = {CoRR},
  volume       = {abs/1707.04769},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.04769},
  eprinttype    = {arXiv},
  eprint       = {1707.04769},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/PlautR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1711-04066,
  author       = {Benjamin Plaut and
                  Tim Roughgarden},
  title        = {Communication Complexity of Discrete Fair Division},
  journal      = {CoRR},
  volume       = {abs/1711.04066},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.04066},
  eprinttype    = {arXiv},
  eprint       = {1711.04066},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-04066.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aaai/PlautDS16,
  author       = {Benjamin Plaut and
                  John P. Dickerson and
                  Tuomas Sandholm},
  editor       = {Dale Schuurmans and
                  Michael P. Wellman},
  title        = {Fast Optimal Clearing of Capped-Chain Barter Exchanges},
  booktitle    = {Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence,
                  February 12-17, 2016, Phoenix, Arizona, {USA}},
  pages        = {601--607},
  publisher    = {{AAAI} Press},
  year         = {2016},
  url          = {https://doi.org/10.1609/aaai.v30i1.10053},
  doi          = {10.1609/AAAI.V30I1.10053},
  timestamp    = {Mon, 04 Sep 2023 15:08:28 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/PlautDS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigecom/DickersonMPST16,
  author       = {John P. Dickerson and
                  David F. Manlove and
                  Benjamin Plaut and
                  Tuomas Sandholm and
                  James Trimble},
  editor       = {Vincent Conitzer and
                  Dirk Bergemann and
                  Yiling Chen},
  title        = {Position-Indexed Formulations for Kidney Exchange},
  booktitle    = {Proceedings of the 2016 {ACM} Conference on Economics and Computation,
                  {EC} '16, Maastricht, The Netherlands, July 24-28, 2016},
  pages        = {25--42},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2940716.2940759},
  doi          = {10.1145/2940716.2940759},
  timestamp    = {Fri, 09 Jul 2021 11:46:27 +0200},
  biburl       = {https://dblp.org/rec/conf/sigecom/DickersonMPST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/PlautDS16,
  author       = {Benjamin Plaut and
                  John P. Dickerson and
                  Tuomas Sandholm},
  title        = {Hardness of the Pricing Problem for Chains in Barter Exchanges},
  journal      = {CoRR},
  volume       = {abs/1606.00117},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.00117},
  eprinttype    = {arXiv},
  eprint       = {1606.00117},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/PlautDS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DickersonMPST16,
  author       = {John P. Dickerson and
                  David F. Manlove and
                  Benjamin Plaut and
                  Tuomas Sandholm and
                  James Trimble},
  title        = {Position-Indexed Formulations for Kidney Exchange},
  journal      = {CoRR},
  volume       = {abs/1606.01623},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.01623},
  eprinttype    = {arXiv},
  eprint       = {1606.01623},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DickersonMPST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.