default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Plaut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Benjamin Plaut, Hanlin Zhu, Stuart Russell:
Avoiding Catastrophe in Continuous Spaces by Asking for Help. CoRR abs/2402.08062 (2024)- [i10]Benjamin Plaut, Khanh Nguyen, Tu Trinh:
Softmax Probabilities (Mostly) Predict Large Language Model Correctness on Multiple-Choice Q&A. CoRR abs/2402.13213 (2024) - 2021
- [b1]Benjamin Plaut:
Algorithms for fair public and private resource allocation. Stanford University, USA, 2021 - [j3]Nikhil Garg, Ashish Goel, Benjamin Plaut
:
Markets for public decision-making. Soc. Choice Welf. 56(4): 755-801 (2021) - 2020
- [j2]Benjamin Plaut, Tim Roughgarden:
Communication Complexity of Discrete Fair Division. SIAM J. Comput. 49(1): 206-243 (2020) - [j1]Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. SIAM J. Discret. Math. 34(2): 1039-1068 (2020) - [c10]Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut:
Almost Envy-Free Repeated Matching in Two-Sided Markets. WINE 2020: 3-16 - [c9]Benjamin Plaut:
Optimal Nash Equilibria for Bandwidth Allocation. WINE 2020: 77-88 - [c8]Ashish Goel, Benjamin Plaut:
Counteracting Inequality in Markets via Convex Pricing. WINE 2020: 89-101 - [i9]Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut:
Almost Envy-free Repeated Matching in Two-sided Markets. CoRR abs/2009.09336 (2020) - [i8]Ashish Goel, Benjamin Plaut:
Counteracting Inequality in Markets via Convex Pricing. CoRR abs/2009.09351 (2020)
2010 – 2019
- 2019
- [c7]Benjamin Plaut, Tim Roughgarden:
Communication Complexity of Discrete Fair Division. SODA 2019: 2014-2033 - [c6]Ashish Goel, Reyna Hulett, Benjamin Plaut:
Markets Beyond Nash Welfare for Leontief Utilities. WINE 2019: 340 - [c5]Nicole Immorlica, Benjamin Plaut, E. Glen Weyl:
Equality of Power and Fair Public Decision-Making. WINE 2019: 342 - [i7]Benjamin Plaut:
Optimal Nash Equilibria for Bandwidth Allocation. CoRR abs/1904.03322 (2019) - 2018
- [c4]Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. SODA 2018: 2584-2603 - [c3]Nikhil Garg, Ashish Goel, Benjamin Plaut:
Markets for Public Decision-Making. WINE 2018: 445 - [i6]Ashish Goel, Reyna Hulett, Benjamin Plaut:
Markets Beyond Nash Welfare for Leontief Utilities. CoRR abs/1807.05293 (2018) - [i5]Nikhil Garg, Ashish Goel, Benjamin Plaut:
Markets for Public Decision-making. CoRR abs/1807.10836 (2018) - 2017
- [i4]Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. CoRR abs/1707.04769 (2017) - [i3]Benjamin Plaut, Tim Roughgarden:
Communication Complexity of Discrete Fair Division. CoRR abs/1711.04066 (2017) - 2016
- [c2]Benjamin Plaut, John P. Dickerson, Tuomas Sandholm:
Fast Optimal Clearing of Capped-Chain Barter Exchanges. AAAI 2016: 601-607 - [c1]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. EC 2016: 25-42 - [i2]Benjamin Plaut, John P. Dickerson, Tuomas Sandholm:
Hardness of the Pricing Problem for Chains in Barter Exchanges. CoRR abs/1606.00117 (2016) - [i1]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. CoRR abs/1606.01623 (2016)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
