George Christodoulou

Yiannis Giannakopoulos

Diogo Poças

Clara Waldmann

Math. Oper. Res., February, 2023

Impartial Selection with Prior Information.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Nicos Protopapas

Proceedings of the ACM Web Conference 2023, 2023

A Proof of the Nisan-Ronen Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Fair allocation in graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

On the nisan-ronen conjecture.

[BibT_eX]

[DOI]

SIGecom Exch., July, 2022

Impartial Selection with Additive Approximation Guarantees.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Nicos Protopapas

Theory Comput. Syst., 2022

Optimal Deterministic Clock Auctions and Beyond.

[BibT_eX]

[DOI]

Vasilis Gkatzelis

Daniel Schoepflin

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Truthful Aggregation of Budget Proposals with Proportionality Guarantees.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Nicos Protopapas

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Introduction to the Special Issue on WINE'18: Part 2.

[BibT_eX]

[DOI]

Tobias Harks

ACM Trans. Economics and Comput., 2021

Introduction to the Special Issue on WINE'18: Part 1.

[BibT_eX]

[DOI]

Tobias Harks

ACM Trans. Economics and Comput., 2021

Truthful Allocation in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

On the Nisan-Ronen conjecture for submodular valuations.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Resource-Aware Protocols for Network Cost-Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019

The Price of Stability of Weighted Congestion Games.

[BibT_eX]

[DOI]

Yiannis Giannakopoulos

SIAM J. Comput., 2019

Designing Networks with Good Equilibria under Uncertainty.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Designing Cost-Sharing Methods for Bayesian Games.

[BibT_eX]

[DOI]

Stefano Leonardi

Theory Comput. Syst., 2019

2018

On the Efficiency of All-Pay Mechanisms.

[BibT_eX]

[DOI]

Bo Tang

Algorithmica, 2018

Strategic Contention Resolution in Multiple Channels.

[BibT_eX]

[DOI]

Themistoklis Melissourgos

Christos-Alexandros Psomas

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

An Improved Envy-Free Cake Cutting Protocol for Four Agents.

[BibT_eX]

[DOI]

Eftychia Vakaliou

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback.

[BibT_eX]

[DOI]

Themistoklis Melissourgos

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

An Improved Upper Bound for the Universal TSP on the Grid.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Cost-Sharing Methods for Scheduling Games under Uncertainty.

[BibT_eX]

[DOI]

Vasilis Gkatzelis

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.

[BibT_eX]

[DOI]

Christoforos L. Raptopoulos

Sotiris E. Nikoletseas

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Price of Anarchy.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Price of Stability in Polynomial Congestion Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources.

[BibT_eX]

[DOI]

Bo Tang

Theory Comput. Syst., 2016

Bayesian Combinatorial Auctions.

[BibT_eX]

[DOI]

Michael Schapira

J. ACM, 2016

Strategic Contention Resolution with Limited Feedback.

[BibT_eX]

[DOI]

Christoforos L. Raptopoulos

Sotiris E. Nikoletseas

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Social Welfare in One-Sided Matching Mechanisms.

[BibT_eX]

[DOI]

Søren Kristoffer Stiil Frederiksen

Aris Filos-Ratsikas

Paul W. Goldberg

Jie Zhang

Jinshan Zhang

Proceedings of the Autonomous Agents and Multiagent Systems - AAMAS 2016 Workshops, - Best Papers, 2016

Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract).

[BibT_eX]

[DOI]

Søren Kristoffer Stiil Frederiksen

Aris Filos-Ratsikas

Paul W. Goldberg

Jie Zhang

Jinshan Zhang

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Mechanisms for Scheduling with Single-Bit Private Values.

[BibT_eX]

[DOI]

Vincenzo Auletta

Paolo Penna

Theory Comput. Syst., 2015

Welfare Ratios in One-Sided Matching Mechanisms.

[BibT_eX]

[DOI]

Søren Kristoffer Stiil Frederiksen

Aris Filos-Ratsikas

Paul W. Goldberg

Jie Zhang

Jinshan Zhang

CoRR, 2015

Universal Network Cost-Sharing Design.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Evangelia Pyrga

Algorithmica, 2014

Contention Resolution under Selfishness.

[BibT_eX]

[DOI]

Katrina Ligett

Evangelia Pyrga

Algorithmica, 2014

2013

A truthful constant approximation for maximizing the minimum load on related machines.

[BibT_eX]

[DOI]

Rob van Stee

Theor. Comput. Sci., 2013

A Deterministic Truthful PTAS for Scheduling Related Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

2012

Convergence and approximation in potential games.

[BibT_eX]

[DOI]

Vahab S. Mirrokni

Anastasios Sidiropoulos

Theor. Comput. Sci., 2012

2011

On the Performance of Approximate Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Algorithmica, 2011

A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010

Mechanism design for fractional scheduling on unrelated machines.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Truthful Mechanisms for Exhibitions.

[BibT_eX]

[DOI]

Khaled M. Elbassioni

Mahmoud Fouz

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

2009

Coordination mechanisms.

[BibT_eX]

[DOI]

Akash Nanavati

Theor. Comput. Sci., 2009

Mechanism Design for Scheduling.

[BibT_eX]

Bull. EATCS, 2009

A Lower Bound for Scheduling Mechanisms.

[BibT_eX]

[DOI]

Angelina Vidali

Algorithmica, 2009

On the Price of Stability for Undirected Network Design.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008

Price of Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Characterization of 2-Player Mechanisms for Scheduling.

[BibT_eX]

[DOI]

Angelina Vidali

Proceedings of the Algorithms, 2008

2007

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.

[BibT_eX]

[DOI]

Laurent Gourvès

Fanny Pascual

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2005

The price of anarchy of finite congestion games.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.

[BibT_eX]

[DOI]