Thomas Lücking

According to our database, Thomas Lücking authored at least 19 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Which is the Worst-Case Nash Equilibrium?

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto

SIAM J. Discret. Math., 2024

2006

The Price of Anarchy for Restricted Parallel Links.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Parallel Process. Lett., 2006

2005

Analyzing models for scheduling and routing.

Thomas Lücking

PhD thesis, 2005

Structure and complexity of extreme Nash equilibria.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis

Theor. Comput. Sci., 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.

Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.

Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Computing Nash equilibria for scheduling on restricted parallel links.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A New Model for Selfish Routing.

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode

Proceedings of the STACS 2004, 2004

The Price of Anarchy for Polynomial Social Cost.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Nash Equilibria in Discrete Routing Games with Convex Latency Functions.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

On Spectral Bounds for the k-Partitioning of Graphs.

Robert Elsässer, Thomas Lücking, Burkhard Monien

Theory Comput. Syst., 2003

A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks.

Thomas Decker, Thomas Lücking, Burkhard Monien

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Which Is the Worst-Case Nash Equilibrium?

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Selfish Routing in Non-cooperative Networks: A Survey.

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Nashification and the Coordination Ratio for a Selfish Routing Game.

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

On the Problem of Scheduling Flows on Distributed Networks.

Thomas Lücking, Burkhard Monien, Manuel Rode

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

New spectral bounds on k-partitioning of graphs.

Robert Elsässer, Thomas Lücking, Burkhard Monien

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Subresultants Revisited.

Joachim von zur Gathen, Thomas Lücking

Proceedings of the LATIN 2000: Theoretical Informatics, 2000