scientific article; zbMATH DE number 1954379
From MaRDI portal
Publication:4415250
zbMath1027.68502MaRDI QIDQ4415250
Rahul Sami, Arvind Krishnamurthy, Joan Feigenbaum, Scott J. Shenker
Publication date: 28 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2556/25560133.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (3)
The complexity of egalitarian mechanisms for linear programming games ⋮ Hardness results for multicast cost sharing. ⋮ Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
This page was built for publication:
