Thomas Lücking

Available identifiers

Publication	Date of Publication	Type
Which is the worst-case Nash equilibrium?	2024-06-08	Paper
Computing Nash equilibria for scheduling on restricted parallel links	2010-10-06	Paper
Computing Nash equilibria for scheduling on restricted parallel links	2010-08-15	Paper
Theoretical Computer Science	2010-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q3395978	2009-09-15	Paper
Approximation and Online Algorithms	2009-08-11	Paper
Nash equilibria in discrete routing games with convex latency functions	2008-11-19	Paper
A new model for selfish routing	2008-11-12	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
STACS 2004	2007-10-01	Paper
The price of anarchy for polynomial social cost	2007-01-09	Paper
A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks	2006-09-14	Paper
Automata, Languages and Programming	2006-01-10	Paper
Structure and complexity of extreme Nash equilibria	2005-10-26	Paper
Automata, Languages and Programming	2005-08-24	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4668737	2005-04-15	Paper
On spectral bounds for the \(k\)-partitioning of graphs	2004-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4449200	2004-02-08	Paper
Subresultants revisited.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4708598	2003-06-18	Paper
https://portal.mardi4nfdi.de/entity/Q4508389	2002-05-09	Paper

This page was built for person: Thomas Lücking