 | Up a level |
Number of items: 2.
Gairing, Martin, Harks, Tobias and Klimm, Max
(2013)
Complexity and Approximation of the Continuous Network Design Problem.
In:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain.
LIPIcs, 28
.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 226-241.
ISBN 9783939897743
Feldotto, M, Gairing, M, Kotsialou, G and Skopalik, A
(2017)
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.
In: Conference on Web and Internet Economics, 2017-12-17 - 2017-12-20, Bangalore, India.