Manuel Rode

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:11/5611 · DBLP profile ↗

← Back

8ranked-venue papers

0as first author

0since 2021 · last 2008

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

2 papers

Algorithmic game theory and mechanism design · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts nash equilibrium	0.1	2	2004	Nash Equilibria in Discrete Routing Games with Convex Latency Functions · ICALP 2004 Nashification and the Coordination Ratio for a Selfish Routing Game · ICALP 2003
Algorithmic game theory and mechanism design › congestion games selfish routing	0.1	2	2004	Nash Equilibria in Discrete Routing Games with Convex Latency Functions · ICALP 2004 Nashification and the Coordination Ratio for a Selfish Routing Game · ICALP 2003
Algorithmic game theory and mechanism design coordination ratio	0.0	1	2003	Nashification and the Coordination Ratio for a Selfish Routing Game · ICALP 2003
Algorithmic game theory and mechanism design › social choice nash implementation	0.0	1	2003	Nashification and the Coordination Ratio for a Selfish Routing Game · ICALP 2003

Methods — techniques the papers use, named apart from their topics

game theory · 0.1convex latency functions · 0.0price of anarchy · 0.0

Year	Publication	Venue	Position
2008	Nash equilibria in discrete routing games with convex latency functions Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode	J. Comput. Syst. Sci.	5
2008	A new model for selfish routing Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode	Theor. Comput. Sci.	4
2004	Nash Equilibria in Discrete Routing Games with Convex Latency Functions Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode	ICALP	5
2004	A New Model for Selfish Routing Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode	STACS	4
2003	Nashification and the Coordination Ratio for a Selfish Routing Game Rainer Feldmann, Martin Gairing, Thomas Lücking 0001, Burkhard Monien, Manuel Rode	ICALP	5
2003	Selfish Routing in Non-cooperative Networks: A Survey Rainer Feldmann, Martin Gairing, Thomas Lücking 0001, Burkhard Monien, Manuel Rode	MFCS	5
2003	Which Is the Worst-Case Nash Equilibrium? Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto	MFCS	4
2002	On the Problem of Scheduling Flows on Distributed Networks Thomas Lücking 0001, Burkhard Monien, Manuel Rode	MFCS	3