On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem

DOI10.1007/11780823_23zbMath1222.90008OpenAlexW1518766710MaRDI QIDQ3613659

Guido Proietti, Davide Bilò, Luciano Gualà

Publication date: 12 March 2009

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780823_23

zbMATH Keywords

algorithmic mechanism designtruthful mechanismsbicriteria network design problemsbroadcasting tree

Mathematics Subject Classification ID

Noncooperative games (91A10) Communication networks in operations research (90B18) Approximation algorithms (68W25)

Related Items (2)

Truthful optimization using mechanisms with verification ⋮ Dynamic mechanism design

This page was built for publication: On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem