2.4k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of PatrasGR41 papers
- University of LiverpoolGB8 papers
- National and Kapodistrian University of AthensGR7 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- University of PiraeusGR6 papers
- Institute of Informatics and TelematicsIT5 papers
- National Research CouncilLK5 papers
- Hellenic Open UniversityGR4 papers
- University of IoanninaGR4 papers
- University of the AegeanGR4 papers
- Durham UniversityGB3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
14 papers · 1 filter
Envy-freeness up to any item with high Nash welfare: The virtue of donating items
Ioannis Caragiannis, Nick Gravin, Xin Huang
Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to an…
An almost ideal coordination mechanism for unrelated machine scheduling
Ioannis Caragiannis, Angelo Fanelli
Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a scheduling policy within each machine and n…
Computing Approximate Nash Equilibria in Polymatrix Games
Argyrios Deligkas, John Fearnley, Rahul Savani +1
In an -Nash equilibrium, a player can gain at most by unilaterally changing his behaviour. For two-player (bimatrix) games with payoffs in , the best-known achieva…
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin
We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation ga…
Welfare guarantees for proportional allocations
Ioannis Caragiannis, Alexandros A. Voudouris
According to the proportional allocation mechanism from the network optimization literature, users compete for a divisible resource -- such as bandwidth -- by submitting bids. The…
Minority Becomes Majority in Social Networks
Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli +2
It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a pub…
On the Stability of Generalized Second Price Auctions with Budgets
Josep Diaz, Ioannis Giotis, Lefteris Kirousis +2
The Generalized Second Price (GSP) auction used typically to model sponsored search auctions does not include the notion of budget constraints, which is present in practice. Motiva…
On the Structure of Equilibria in Basic Network Formation
S. Nikoletseas, P. Panagopoulou, C. Raptopoulos +1
We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in wh…
On the Hardness of Network Design for Bottleneck Routing Games
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas +1
In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess'…
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…
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin +1
We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existenc…
Enforcing efficient equilibria in network design games via subsidies
John Augustine, Ioannis Caragiannis, Angelo Fanelli +1
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select a…
Robust Line Planning in case of Multiple Pools and Disruptions
Apostolos Bessas, Spyros Kontogiannis, Christos Zaroliagis
We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools,…
A Graph Spectral Approach for Computing Approximate Nash Equilibria
Haralampos Tsaknakis, Paul G. Spirakis
We present a new methodology for computing approximate Nash equilibria for two-person non-cooperative games based upon certain extensions and specializations of an existing optimiz…