Research map / Learning theory and algorithms / Combinatorial and search optimization
Partial Verification as a Substitute for Money
Sofia Ceppi, Ian Kash, Rafael Frongillo
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use truthful-in-expectation mechanisms instead of deterministic mechanisms | Single-agent mechanisms with no indifferences between assignments · General type space | harmless-set size | Hurt |
| Allow universally truthful randomization over deterministic mechanisms | Single-agent mechanisms · General type space | harmless set | No clear effect |
| Characterize verification using critical allocation hyperplanes for each pair of allocations | Implementable-with-payments allocation rules · More than two allocations | harmless-set characterization | Improved |
| Restrict reports to be close to the true type | Verification for implementable-with-payments allocation rules · Two allocations | prevention of profitable misreports | No clear effect |
| Use asymmetric verification that rules out the half-space beyond the critical allocation hyperplane | Verification for implementable-with-payments allocation rules · Two allocations | prevention of profitable misreports | Improved |
| Add allocation-dependent verification | Verification for a fixed allocation rule · General mechanisms | number of types requiring verification | Improved |
| Use no-underbidding and direction-imposing verification | Fixed tie-breaking implementable-with-payments allocation rules · K-facility location on a line | truthfulness | Improved |
| Remove the requirement to verify when truthful allocation is already the agent's preferred allocation | No-underbidding and direction-imposing verification · K-facility location on a line | verification required | Improved |
Closest papers by meaning
- When to Trust the Cheap Check: Weak and Strong Verification for Reasoning (ICML 2026 · similarity 0.83)
- Reachability of Fair Allocations via Sequential Exchanges (AAAI 2024 · similarity 0.80)
- Plant-and-Steal: Truthful Fair Allocations via Predictions (NeurIPS 2024 · similarity 0.79)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.79)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.79)
- Project-Fair and Truthful Mechanisms for Budget Aggregation (AAAI 2024 · similarity 0.78)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
