Ioannis Caragiannis

Ioannis Caragiannis

Auto-generated profile, based on publicly available information

Ioannis Caragiannis

Aarhus University

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2011 in Artificial Intelligence
Verified
Journal Article
Closed access
ICIoannis Caragiannis
Ioannis Caragiannis
APAriel D. Procaccia
Ariel D. Procaccia

8 September 2011 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
ICIoannis Caragiannis
Ioannis Caragiannis
CKChristos Kaklamanis
Christos Kaklamanis
PKPanagiotis Kanellopoulos
Panagiotis Kanellopoulos
MKMaria Kyropoulou
Maria Kyropoulou

9 November 2021 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Closed access
PDF file
HAHaris Aziz
Haris Aziz
ICIoannis Caragiannis
Ioannis Caragiannis
AIAyumi Igarashi
Ayumi Igarashi
TWToby Walsh
Toby Walsh

17 July 2010 in Algorithmica
Verified
Journal Article
Closed access
PDF file
ICIoannis Caragiannis
Ioannis Caragiannis
Michele FlamminiMichele Flammini
Michele Flammini
CKChristos Kaklamanis
Christos Kaklamanis
PKPanagiotis Kanellopoulos
Panagiotis Kanellopoulos
LMLuca Moscardelli
Luca Moscardelli

1 October 2011
Verified
Conference Paper
Closed access
ICIoannis Caragiannis
Ioannis Caragiannis
AFAngelo Fanelli
Angelo Fanelli
NGNick Gravin
Nick Gravin
ASAlexander Skopalik
Alexander Skopalik
Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general PLS-complete. We present a surprisingly simple polynomial-time algorithm that computes O(1)-approximate Nash equilibria in these games. In particular, for congestion games with linear latency functions, our algorithm computes (2 +ε)-approximate pure Nash equilibria in time polynomial in the number of players, the number of resources and 1/ε. It also applies to games with polynomial latency functions with constant maximum degree d: there, the approximation guarantee is d o(d) . The algorithm essentially identifies a polynomially long sequence of best-response moves that lead to an approximate equilibrium; the existence of such short sequences is interesting in itself. These are the first positive algorithmic results for approximate equilibria in non-symmetric congestion games. We strengthen them further by proving that, for congestion games that deviate from our mild assumptions, computing ρ-approximate equilibria is PLS-complete for any polynomial-time computable ρ.

1 January 2006
Verified
Book Chapter
Closed access
PDF file
ICIoannis Caragiannis
Ioannis Caragiannis
Michele FlamminiMichele Flammini
Michele Flammini
CKChristos Kaklamanis
Christos Kaklamanis
PKPanagiotis Kanellopoulos
Panagiotis Kanellopoulos
LMLuca Moscardelli
Luca Moscardelli