Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
From MaRDI portal
Publication:3601792
Recommendations
Cites work
- scientific article; zbMATH DE number 1617333 (Why is no real title available?)
- scientific article; zbMATH DE number 1183297 (Why is no real title available?)
- scientific article; zbMATH DE number 1446599 (Why is no real title available?)
- Computationally feasible VCG mechanisms
- Computationally manageable combinational auctions
- Faster Scaling Algorithms for Network Problems
- Programming and Verifying Subgame-Perfect Mechanisms
- Verifying Dominant Strategy Equilibria in Auctions
Cited in
(8)- Verifying Dominant Strategy Equilibria in Auctions
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
- A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory
- Computer-aided verification for mechanism design
- Model checking auctions as artifact systems: decidability via finite abstraction
- Abstraction-based verification of infinite-state reactive modules
- An introduction to mechanized reasoning
- Strictly strategy-proof auctions
This page was built for publication: Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601792)