The efficiency of fair division I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou Theory of Computing Systems 50, 589-610, 2012 | 222 | 2012 |
Geometric clustering to minimize the sum of cluster sizes V Bilo, I Caragiannis, C Kaklamanis, P Kanellopoulos Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005 | 110 | 2005 |
Tight bounds for selfish and greedy load balancing I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli Algorithmica 61, 606-637, 2011 | 107 | 2011 |
Tight bounds for selfish and greedy load balancing I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006 | 106 | 2006 |
Bounding the inefficiency of outcomes in generalized second price auctions I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou, B Lucier, ... Journal of Economic Theory 156, 343-388, 2015 | 101 | 2015 |
On the efficiency of equilibria in generalized second price auctions I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou Proceedings of the 12th ACM conference on Electronic commerce, 81-90, 2011 | 92 | 2011 |
Energy-efficient wireless network design I Caragiannis, C Kaklamanis, P Kanellopoulos Theory of Computing Systems 39 (5), 593-617, 2006 | 64 | 2006 |
Taxes for linear atomic congestion games I Caragiannis, C Kaklamanis, P Kanellopoulos ACM Transactions on Algorithms (TALG) 7 (1), 1-31, 2010 | 60 | 2010 |
New bounds on the size of the minimum feedback vertex set in meshes and butterflies I Caragiannis, C Kaklamanis, P Kanellopoulos Information Processing Letters 83 (5), 275-280, 2002 | 56 | 2002 |
New results for energy-efficient broadcasting in wireless networks I Caragiannis, C Kaklamanis, P Kanellopoulos International Symposium on Algorithms and Computation, 332-343, 2002 | 54 | 2002 |
The impact of altruism on the efficiency of atomic congestion games I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou, ... Trustworthly Global Computing: 5th International Symposium, TGC 2010, Munich …, 2010 | 53 | 2010 |
On verifying game designs and playing strategies using reinforcement learning D Kalles, P Kanellopoulos Proceedings of the 2001 ACM symposium on Applied computing, 6-11, 2001 | 48 | 2001 |
On low-envy truthful allocations I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou Algorithmic Decision Theory: First International Conference, ADT 2009 …, 2009 | 34 | 2009 |
Experimental comparison of algorithms for energy-efficient multicasting in ad hoc networks S Athanassopoulos, I Caragiannis, C Kaklamanis, P Kanellopoulos Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, ADHOC …, 2004 | 31 | 2004 |
Taxes for linear atomic congestion games I Caragiannis, C Kaklamanis, P Kanellopoulos European Symposium on Algorithms, 184-195, 2006 | 29 | 2006 |
A minimax tutor for learning to play a board game D Kalles, P Kanellopoulos Proceedings of the AI in Games Workshop, 18th European Conference on …, 2008 | 26 | 2008 |
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem I Caragiannis, C Kaklamanis, P Kanellopoulos Information Processing Letters 86 (3), 149-154, 2003 | 22 | 2003 |
The price of stability of simple symmetric fractional hedonic games C Kaklamanis, P Kanellopoulos, K Papaioannou Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool …, 2016 | 18 | 2016 |
Modified schelling games P Kanellopoulos, M Kyropoulou, AA Voudouris Theoretical Computer Science 880, 1-19, 2021 | 16 | 2021 |
Correction: Basic network creation games N Alon, ED Demaine, MT Hajiaghayi, P Kanellopoulos, T Leighton SIAM Journal on Discrete Mathematics 28 (3), 1638-1640, 2014 | 16 | 2014 |