Panagiotis Kanellopoulos

Orcid: 0000-0002-8093-1379

According to our database1, Panagiotis Kanellopoulos authored at least 49 papers between 2001 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Truthful two-facility location with candidate locations.
Theor. Comput. Sci., 2025

2024
The distortion of distributed facility location.
Artif. Intell., March, 2024

On priority-proportional payments in financial networks.
Theor. Comput. Sci., 2024

Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences.
CoRR, 2024

2023
Not all strangers are the same: The impact of tolerance in Schelling games.
Theor. Comput. Sci., September, 2023

On Discrete Truthful Heterogeneous Two-Facility Location.
SIAM J. Discret. Math., June, 2023

Multi-Objective Optimisation and Genetic Programming for Trading by Combining Directional Changes and Technical Indicators.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

Debt Transfers in Financial Networks: Complexity and Equilibria.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Settling the Distortion of Distributed Facility Location.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Bounding the Inefficiency of Compromise in Opinion Formation.
Algorithmica, 2022

Multi-agent systems for computational economics and finance.
AI Commun., 2022

Genetic Programming for Combining Directional Changes Indicators in International Stock Markets.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Forgiving Debt in Financial Network Games.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Technical and Sentiment Analysis in Financial Forecasting with Genetic Programming.
Proceedings of the IEEE Symposium on Computational Intelligence for Financial Engineering and Economics, 2022

2021
Modified Schelling games.
Theor. Comput. Sci., 2021

On the price of stability of some simple graph-based hedonic games.
Theor. Comput. Sci., 2021

Stable fractional matchings.
Artif. Intell., 2021

On Interim Envy-Free Allocation Lotteries.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Financial network games.
Proceedings of the ICAIF'21: 2nd ACM International Conference on AI in Finance, Virtual Event, November 3, 2021

2018
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

2017
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

2016
The Price of Stability of Simple Symmetric Fractional Hedonic Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Econ. Theory, 2015

2014
Revenue Guarantees in the Generalized Second Price Auction.
ACM Trans. Internet Techn., 2014

Correction: Basic Network Creation Games.
SIAM J. Discret. Math., 2014

A Pendulum Effect of Expert Playing in Games.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2012
The Efficiency of Fair Division.
Theory Comput. Syst., 2012

On the efficiency of equilibria in generalized second price auctions
CoRR, 2012

Revenue Guarantees in Sponsored Search Auctions.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Tight Bounds for Selfish and Greedy Load Balancing.
Algorithmica, 2011

On the efficiency of equilibria in generalized second price auctions.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
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

2009
On Low-Envy Truthful Allocations.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
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

2007
Minimum Energy Communication in Ad Hoc Wireless Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Αλγόριθμοι ελαχιστοποίησης κατανάλωσης ενέργειας σε ασύρματα δίκτυα
PhD thesis, 2007

2006
Energy-Efficient Wireless Network Design.
Theory Comput. Syst., 2006

2005
Geometric Clustering to Minimize the Sum of Cluster Sizes.
Proceedings of the Algorithms, 2005

2004
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

2003
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

2002
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

2001
On verifying game designs and playing strategies using reinforcement learning.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001


  Loading...