Frugal path mechanisms
From MaRDI portal
Publication:2944539
DOI10.1145/1186810.1186813zbMath1321.68375OpenAlexW2061256213MaRDI QIDQ2944539
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1186810.1186813
Programming involving graphs or networks (90C35) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (10)
Efficient Money Burning in General Domains ⋮ Convergence of VCG mechanism to ex-post budget balance in a model of land acquisition ⋮ Setting lower bounds on truthfulness ⋮ Strategic pricing in next-hop routing with elastic demands ⋮ Successive minimum spanning trees ⋮ Unnamed Item ⋮ First-passage percolation on a ladder graph, and the path cost in a VCG auction ⋮ Efficient money burning in general domains ⋮ Optimal collusion-resistant mechanisms with verification ⋮ Maximizing the minimum load for selfish agents
This page was built for publication: Frugal path mechanisms
