The power of verification for one-parameter agents
From MaRDI portal
(Redirected from Publication:1004286)
Recommendations
Cites work
- Algorithmic mechanism design (extended abstract)
- Algorithms – ESA 2005
- Algorithms, games, and the internet
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Implementation with partial verification
- Optimal Auction Design
- Routing selfish unsplittable traffic
- STACS 2005
- Setting lower bounds on truthfulness (extended abstract)
- Worst-case equilibria
Cited in
(17)- Truthful optimization using mechanisms with verification
- Fast payment schemes for truthful mechanisms with verification
- Truthfulness flooded domains and the power of verification for mechanism design
- Computer-aided verification for mechanism design
- The Subset Sum game
- Average-case approximation ratio of scheduling without payments
- Verifiably truthful mechanisms
- A new lower bound for deterministic truthful scheduling
- Optimal collusion-resistant mechanisms with verification
- The power of verification for greedy mechanism design
- New Constructions of Mechanisms with Verification
- Strategyproof facility location in perturbation stable instances
- Optimal on-line allocation rules with verification
- Combinatorial auctions with verification are tractable
- On scheduling mechanisms beyond the worst case
- Automata, Languages and Programming
- Approximation and Online Algorithms
This page was built for publication: The power of verification for one-parameter agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004286)