Optimal on-line allocation rules with verification

DOI10.1007/978-3-030-30473-7_1zbMATH Open1431.91183OpenAlexW2972439358MaRDI QIDQ2292610FDOQ2292610

Authors: Markos Epitropou, Rakesh V. Vohra 

Publication date: 4 February 2020

Full work available at URL: https://rd.springer.com/content/pdf/10.1007%2F978-3-030-30473-7_1.pdf

Recommendations

• A note on optimal allocation with costly verification
• The power of verification for one-parameter agents
• Prophet secretary
• Optimal allocation with costly inspection and discrete types under ambiguity
• Prophet inequalities vs. approximating optimum online

zbMATH Keywords

verificationprophet inequalitiesstopping problems

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Principal-agent models (91B43)

Cited In (4)

• Optimal multi-unit allocation with costly verification
• Optimal assignment mechanisms with imperfect verification
• Bayesian persuasion: reduced form approach
• A note on optimal allocation with costly verification

This page was built for publication: Optimal on-line allocation rules with verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292610)