Mechanism design for policy routing
From MaRDI portal
Publication:2375297
DOI10.1007/s00446-005-0134-7zbMath1266.68036MaRDI QIDQ2375297
Rahul Sami, Joan Feigenbaum, Scott J. Shenker
Publication date: 13 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-005-0134-7
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M11: Internet topics
Related Items
Cites Work
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A BGP-based mechanism for lowest-cost routing
- Smoothed analysis of algorithms
- Incentives in Teams
- Mechanism design for policy routing
- Optimum branchings
- Algorithmic mechanism design
- Sharing the cost of multicast transmissions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item