According to our database1, Panagiotis Kanellopoulos authored at least 30 papers between 2001 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Stable Fractional Matchings.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
On network formation games with heterogeneous players and basic network creation games.
Theor. Comput. Sci., 2018
On the Price of Stability of Social Distance Games.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018
Efficiency and complexity of price competition among single-product vendors.
Artif. Intell., 2017
Bounding the Inefficiency of Compromise.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
How Game Complexity Affects the Playing Behavior of Synthetic Agents.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2017
The Price of Stability of Simple Symmetric Fractional Hedonic Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Econ. Theory, 2015
Revenue Guarantees in the Generalized Second Price Auction.
ACM Trans. Internet Techn., 2014
Correction: Basic Network Creation Games.
SIAM J. Discrete Math., 2014
A Pendulum Effect of Expert Playing in Games.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014
The Efficiency of Fair Division.
Theory Comput. Syst., 2012
On the efficiency of equilibria in generalized second price auctions
Revenue Guarantees in Sponsored Search Auctions.
Proceedings of the Algorithms - ESA 2012, 2012
Tight Bounds for Selfish and Greedy Load Balancing.
On the efficiency of equilibria in generalized second price auctions.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011
Taxes for linear atomic congestion games.
ACM Trans. Algorithms, 2010
The Impact of Altruism on the Efficiency of Atomic Congestion Games.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010
On Low-Envy Truthful Allocations.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009
Scheduling to maximize participation.
Theor. Comput. Sci., 2008
Improving the Efficiency of Load Balancing Games through Taxes.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Minimum Energy Communication in Ad Hoc Wireless Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007
Energy-Efficient Wireless Network Design.
Theory Comput. Syst., 2006
Geometric Clustering to Minimize the Sum of Cluster Sizes.
Proceedings of the Algorithms, 2005
Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem.
Inf. Process. Lett., 2003
Power Consumption Problems in Ad-Hoc Wireless Networks.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003
New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
Inf. Process. Lett., 2002
New Results for Energy-Efficient Broadcasting in Wireless Networks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
On verifying game designs and playing strategies using reinforcement learning.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001