Obserwuj
Panagiotis Kanellopoulos
Tytuł
Cytowane przez
Cytowane przez
Rok
The efficiency of fair division
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou
Theory of Computing Systems 50, 589-610, 2012
2332012
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
Algorithmica 61, 606-637, 2011
218*2011
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
183*2015
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
1112005
Taxes for linear atomic congestion games
I Caragiannis, C Kaklamanis, P Kanellopoulos
ACM Transactions on Algorithms (TALG) 7 (1), 1-31, 2010
92*2010
Energy-efficient wireless network design
I Caragiannis, C Kaklamanis, P Kanellopoulos
Theory of Computing Systems 39 (5), 593-617, 2006
652006
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
562002
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
552010
New results for energy-efficient broadcasting in wireless networks
I Caragiannis, C Kaklamanis, P Kanellopoulos
International Symposium on Algorithms and Computation, 332-343, 2002
542002
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
482001
On low-envy truthful allocations
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou
Algorithmic Decision Theory: First International Conference, ADT 2009 …, 2009
342009
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
312004
On the price of stability of some simple graph-based hedonic games
C Kaklamanis, P Kanellopoulos, K Papaioannou, D Patouchas
Theoretical Computer Science 855, 1-15, 2021
30*2021
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
262008
Modified schelling games
P Kanellopoulos, M Kyropoulou, AA Voudouris
Theoretical Computer Science 880, 1-19, 2021
242021
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
222003
Technical and Sentiment Analysis in Financial Forecasting with Genetic Programming
E Christodoulaki, M Kampouridis, P Kanellopoulos
IEEE Symposium on Computational Intelligence for Financial Engineering and …, 2022
192022
On Discrete Truthful Heterogeneous Two-Facility Location
P Kanellopoulos, AA Voudouris, R Zhang
SIAM Journal on Discrete Mathematics 37 (2), 779-799, 2023
172023
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
162014
Forgiving Debt in Financial Network Games
P Kanellopoulos, M Kyropoulou, H Zhou
31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2022
152022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20