Routing selfish unsplittable traffic

DOI10.1145/1290672.1290689zbMath1446.91034OpenAlexW2148342922MaRDI QIDQ4962692

Paolo Penna, Giuseppe Persiano, Roberto De Prisco, Vincenzo Auletta

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.494.1159

zbMATH Keywords

schedulingNash equilibriumalgorithmic mechanism designselfish routing

Mathematics Subject Classification ID

Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Mechanism design theory (91B03)

Related Items (1)

The power of verification for one-parameter agents

This page was built for publication: Routing selfish unsplittable traffic