Benjamin Plaut

Orcid: 0000-0002-0388-9023

According to our database1, Benjamin Plaut authored at least 20 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Check Yourself Before You Wreck Yourself: Selectively Quitting Improves LLM Agent Safety.
CoRR, October, 2025

Learning When Not to Learn: Risk-Sensitive Abstention in Bandits with Unbounded Rewards.
CoRR, October, 2025

Asking for Help Enables Safety Guarantees Without Sacrificing Effectiveness.
CoRR, February, 2025

Learning to Coordinate with Experts.
CoRR, February, 2025

Probabilities of Chat LLMs Are Miscalibrated but Still Predict Correctness on Multiple-Choice Q&A.
Trans. Mach. Learn. Res., 2025

2024
Getting By Goal Misgeneralization With a Little Help From a Mentor.
CoRR, 2024

Softmax Probabilities (Mostly) Predict Large Language Model Correctness on Multiple-Choice Q&A.
CoRR, 2024

Avoiding Catastrophe in Continuous Spaces by Asking for Help.
CoRR, 2024

2021
Algorithms for fair public and private resource allocation.
PhD thesis, 2021

2020
Optimal Nash Equilibria for Bandwidth Allocation.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Almost Envy-Free Repeated Matching in Two-Sided Markets.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Counteracting Inequality in Markets via Convex Pricing.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019
Equality of Power and Fair Public Decision-Making.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Markets Beyond Nash Welfare for Leontief Utilities.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Communication Complexity of Discrete Fair Division.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Markets for Public Decision-Making.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Almost Envy-Freeness with General Valuations.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2016
Hardness of the Pricing Problem for Chains in Barter Exchanges.
CoRR, 2016

Position-Indexed Formulations for Kidney Exchange.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Fast Optimal Clearing of Capped-Chain Barter Exchanges.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016


  Loading...