The power of verification for one-parameter agents
DOI10.1016/J.JCSS.2008.10.001zbMATH Open1169.68027OpenAlexW1965047789MaRDI QIDQ1004286FDOQ1004286
Authors: V. Auletta, Paolo Penna, Giuseppe Persiano, Roberto De Prisco 
Publication date: 2 March 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.10.001
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60) Other game-theoretic models (91A40)
Cites Work
- Worst-case equilibria
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Optimal Auction Design
- Algorithms, games, and the internet
- Algorithmic mechanism design (extended abstract)
- STACS 2005
- Title not available (Why is that?)
- Implementation with partial verification
- Algorithms – ESA 2005
- Routing selfish unsplittable traffic
Cited In (12)
- Truthful optimization using mechanisms with verification
- Fast payment schemes for truthful mechanisms with verification
- The Subset Sum game
- Average-case approximation ratio of scheduling without payments
- A new lower bound for deterministic truthful scheduling
- Optimal collusion-resistant mechanisms with verification
- New Constructions of Mechanisms with Verification
- Strategyproof facility location in perturbation stable instances
- 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)
