4 citations · 12 across the 13 of their papers we have counts for
18 papers
Truthful Two-Facility Location with Candidate Locations in Metric Spaces
Panagiotis Kanellopoulos, Alexandros A. Voudouris
We study a truthful facility location problem in which agents have private positions in a metric space and known approval preferences over two distinct facilities. Each agent incur…
Discrete Truthful Heterogeneous Two-Facility Location: The Line and Beyond
Panagiotis Kanellopoulos, Alexandros A. Voudouris
We study deterministic strategyproof mechanisms for discrete heterogeneous two-facility location. In our model, agents occupy distinct nodes of a connected graph and privately…
Distributed Agent-Constrained Truthful Facility Location
Argyrios Deligkas, Panagiotis Kanellopoulos, Alexandros A. Voudouris
We study a distributed facility location problem in which a set of agents, each with a private position on the real line, is partitioned into a collection of fixed, disjoint groups…
Truthful Facility Location with Candidate Locations and Limited Resources
Panagiotis Kanellopoulos, Alexandros A. Voudouris
We study a truthful facility location problem where one out of available facilities must be built at a location chosen from a set of candidate ones in the interval …
Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences
Panagiotis Kanellopoulos, Alexandros A. Voudouris
We consider a truthful facility location problem with agents that have private positions on the line of real numbers and known optional preferences over two obnoxious facilities th…
Truthful Two-Facility Location with Candidate Locations
Panagiotis Kanellopoulos, Alexandros A. Voudouris, Rongsen Zhang
We study a truthful two-facility location problem in which a set of agents have private positions on the line of real numbers and known approval preferences over two different faci…
Settling the Distortion of Distributed Facility Location
Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Alexandros A. Voudouris +1
We study the distributed facility location problem, where a set of agents with positions on the line of real numbers are partitioned into disjoint districts, and the goal is to cho…
Multi-Agent Systems for Computational Economics and Finance
Michael Kampouridis, Panagiotis Kanellopoulos, Maria Kyropoulou +2
In this article we survey the main research topics of our group at the University of Essex. Our research interests lie at the intersection of theoretical computer science, artifici…
Optimal Bailouts and Strategic Debt Forgiveness in Financial Networks
Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou
A financial system is represented by a network, where nodes correspond to banks, and directed labeled edges correspond to debt contracts between banks. Once a payment schedule has…
On Discrete Truthful Heterogeneous Two-Facility Location
Panagiotis Kanellopoulos, Alexandros A. Voudouris, Rongsen Zhang
We revisit the discrete heterogeneous two-facility location problem, in which there is a set of agents that occupy nodes of a line graph, and have private approval preferences over…
Financial Network Games
Panagiotis Kanellopoulos, Maria Kyropoulou, Hao Zhou
We study financial systems from a game-theoretic standpoint. A financial system is represented by a network, where nodes correspond to firms, and directed labeled edges correspond…
Not all Strangers are the Same: The Impact of Tolerance in Schelling Games
Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris
Schelling's famous model of segregation assumes agents of different types who would like to be located in neighborhoods having at least a certain fraction of agents of the same typ…
On Interim Envy-Free Allocation Lotteries
Ioannis Caragiannis, Panagiotis Kanellopoulos, Maria Kyropoulou
With very few exceptions, recent research in fair division has mostly focused on deterministic allocations. Deviating from this trend, we study the fairness notion of interim envy-…
Modified Schelling Games
Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris
We introduce the class of modified Schelling games in which there are different types of agents who occupy the nodes of a location graph; agents of the same type are friends, and a…
How game complexity affects the playing behavior of synthetic agents
Chairi Kiourt, Dimitris Kalles, Panagiotis Kanellopoulos
Agent based simulation of social organizations, via the investigation of agents' training and learning tactics and strategies, has been inspired by the ability of humans to learn f…
Bounding the inefficiency of compromise in opinion formation
Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris
Social networks on the Internet have seen an enormous growth recently and play a crucial role in different aspects of today's life. They have facilitated information dissemination…
Efficiency and complexity of price competition among single-product vendors
Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos +3
Motivated by recent progress on pricing in the AI literature, we study marketplaces that contain multiple vendors offering identical or similar products and unit-demand buyers with…
Bounding the inefficiency of outcomes in generalized second price auctions
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos +4
The Generalized Second Price (GSP) auction is the primary auction used for monetizing the use of the Internet. It is well-known that truthtelling is not a dominant strategy in this…