Verifiably Truthful Mechanisms

DOI10.1145/2688073.2688098zbMath1364.91063arXiv1412.0056OpenAlexW2153285919MaRDI QIDQ2989043

Ariel D. Procaccia, Simina Brânzei

Publication date: 19 May 2017

Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0056

zbMATH Keywords

verificationapproximationfacility locationdecision treesmechanism design

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Specification and verification (program logics, model checking, etc.) (68Q60) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (7)

Obvious strategyproofness, bounded rationality and approximation ⋮ Rationality Authority for Provable Rational Behavior ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Computer-Aided Verification for Mechanism Design ⋮ Facility location games with optional preference ⋮ From Monetary to Nonmonetary Mechanism Design via Artificial Currencies ⋮ Unnamed Item

This page was built for publication: Verifiably Truthful Mechanisms