direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Artikel in Journalen

2016

Harks, Tobias and Klimm, Max
Congestion games with variable demands.
Mathematics of Operations Research, Vol. 41, pp. 255-277, 2016.


2015

Harks, Tobias and Klimm, Max
Equilibria in a Class of Aggregative Location Games.
Journal of Mathematical Economics, Vol. 61, pp. 211-220, 2015.


Disser, Yann and Feldmann, Andreas and Klimm, Max and Mihalák, Matús
Improving the Hk-bound on the price of stability in undirected Shapley network design games.
Theoretical Computer Science, Vol. 562, pp. 557–564, 2015.  [pdf]


Fischer, Felix and Klimm, Max
Optimal Impartial Selection.
SIAM Journal on Computing, Vol. 44, pp. 1263-1285, 2015.  [pdf]


Harks, Tobias and Kleinert, Ingo and Klimm, Max and Möhring, Rolf H.
Computing network tolls with support constraints.
Networks, Vol. 65, pp. 262-285, 2015.


2013

Harks, Tobias and Klimm, Max and Möhring, Rolf H.
Strong equilibria in games with the lexicographical improvement property.
International Journal of Game Theory, Vol. 42, pp. 461 – 482, 2013.  [pdf]


Harks, Tobias and Hoefer, Martin and Klimm, Max and Skopalik, Alexander
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.
Mathematical Programming, Ser. A, Vol. 141, pp. 193 – 215, 2013.


2012

Gawrilow, Ewgenij and Klimm, Max and Möhring, Rolf H. and Stenzel, Björn
Conflict-free vehicle routing: Load balancing and deadlock prevention.
EURO Journal on transportation and logistics, Vol. 1, pp. 87 – 111, 2012.


Harks, Tobias and Klimm, Max
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
Mathematics of Operations Research, Vol. 37, pp. 419 – 436, 2012.


2011

Harks, Tobias and Klimm, Max and Möhring, Rolf H.
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Theory of Computing Systems, Vol. 49, pp. 46 – 70, 2011.


Nach oben

Artikel in referierten Konferenzbänden

2016

Disser, Yann and Hackfeld, Jan and Klimm, Max
Undirected graph exploration with Θ(log log n) pebbles.
In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 25-39, 2016.  [pdf]


2015

Bjelde, Antje and Fischer, Felix and Klimm, Max
Impartial Selection and the Power of Up to Two Choices.
In Proceedings of the 11th Conference on Web and Internet Economics (WINE), 2015.


Harks, Tobias and Klimm, Max
Bottleneck Routing with Elastic Demands.
In Proceedings of the 11th Conference on Web and Internet Economics (WINE), 2015.


Disser, Yann and Klimm, Max and Lübbecke, Elisabeth
Scheduling Bidirectional Traffic on a Path.
In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 406-418, 2015.  [pdf]


Klimm, Max and Schmand, Daniel
Sharing non-anonymous costs of multiple resources optimally.
In Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pp. 274-287, 2015.


2014

Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander
Approximate pure Nash equilibria in weighted congestion games.
In Proceedings of the 17th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 242 – 257, 2014.


Disser, Yann and Megow, Nicole and Klimm, Max and Stiller, Sebastian
Packing a Knapsack of Unknown Capacity.
In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), pp. 276–287, 2014.  [pdf]


Harks, Tobias and Klimm, Max
Multimarket oligopolies with restricted market access.
In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), pp. 182-193, 2014.


Gairing, Martin and Harks, Tobias and Klimm, Max
Complexity and Approximation of the Continuous Network Design Problem.
In Proceedings of the 17th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 226 – 241, 2014.


Fischer, Felix and Klimm, Max
Optimal Impartial Selection.
In Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 803 – 820, 2014.


Harks, Tobias and Klimm, Max and Peis, Britta
Resource Competition on Integral Polymatroids.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE), 2014.


Klimm, Max and Schütz, Andreas
Congestion games with higher demand dimensions.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE), pp. 453-459, 2014.


Klimm, Max
Competition for Resources: The equilibrium Existence Problem in Congestion Games.
In Selected Papers of the International Conference on Operations Research (OR2013), 2014.


2013

Gairing, Martin and Klimm, Max
Congestion Games with Player-Specific Costs Revisited.
In Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), pp. 98 – 109, 2013.


Disser, Yann and Feldmann, Andreas and Klimm, Max and Mihalák, Matúš
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), pp. 158 – 169, 2013.  [pdf]


2011

Goetzmann, Kai and Harks, Tobias and Klimm, Max and Miller, Konstantin
Optimal File Distribution in Peer-to-Peer Networks.
In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 210 – 219, 2011.  [pdf]


Harks, Tobias and Klimm, Max
Congestion Games with Variable Demands.
In Proceedings of the 13th Conference On Theoretical Aspects of Rationality and Knowledge (TARK), pp. 111 – 120, 2011.


Harks, Tobias and Klimm, Max
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.
In Proceedings of the 7th International Workshop on Internet and Network Economics (WINE), pp. 194 – 205, 2011.


2010

Harks, Tobias and Hoefer, Martin and Klimm, Max and Skopalik, Alexander
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.
In Proceedings of the 18th European Symposium on Algorithms (ESA), pp. 29 – 38, 2010.


Harks, Tobias and Klimm, Max
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), pp. 79 – 89, 2010.


2009

Harks, Tobias and Klimm, Max and Möhring, Rolf H.
Strong Nash Equilibria in Games with the Lexicographical Improvement Property.
In Proceedings of the 5th International Workshop on Internet and Network Economics (WINE), pp. 463 – 470, 2009.


Harks, Tobias and Klimm, Max and Möhring, Rolf H.
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
In Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), pp. 97 – 108, 2009.


Nach oben

Zusatzinformationen / Extras