Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Panagopoulou, Panagiota N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Random bimatrix games are asymptotically easy to solve (a simple proof)
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Theory of Computing Systems
54
(3), 2014, pp. 479-490
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Spyros C. Kontogiannis
,
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Theoretical Computer Science
410
(17), 2009, pp. 1599-1606
Cost sharing mechanisms for fair pricing of resource usage
Marios Mavronicolas
,
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Algorithmica
52
(1), 2008, pp. 19-43
A game theoretic approach for efficient graph coloring
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Lecture Notes in Computer Science
5369
, 2008, pp. 183-195
Selfish load balancing under partial knowledge
Elias Koutsoupias
,
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Lecture Notes in Computer Science
4708
, 2007, pp. 609-620