Maria Kyropoulou

Theor. Comput. Sci., 2024

2023

Not all strangers are the same: The impact of tolerance in Schelling games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

Enhanced Strongly typed Genetic Programming for Algorithmic Trading.

[BibT_eX]

[DOI]

Evangelia Christodoulaki

Michael Kampouridis

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Debt Transfers in Financial Networks: Complexity and Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Fair cake-cutting in practice.

[BibT_eX]

[DOI]

Josué Ortega

Erel Segal-Halevi

Games Econ. Behav., 2022

Multi-agent systems for computational economics and finance.

[BibT_eX]

[DOI]

Michael Kampouridis

Themistoklis Melissourgos

AI Commun., 2022

Forgiving Debt in Financial Network Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Modified Schelling games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On Interim Envy-Free Allocation Lotteries.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Financial network games.

[BibT_eX]

[DOI]

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

2020

Almost envy-freeness in group resource allocation.

[BibT_eX]

[DOI]

Warut Suksompong

Theor. Comput. Sci., 2020

Obviously Strategyproof Single-Minded Combinatorial Auctions.

[BibT_eX]

[DOI]

Bart de Keijzer

Carmine Ventre

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

The anarchy of scheduling without money.

[BibT_eX]

[DOI]

Yiannis Giannakopoulos

Elias Koutsoupias

Theor. Comput. Sci., 2019

Mechanism Design for Constrained Heterogeneous Facility Location.

[BibT_eX]

[DOI]

Carmine Ventre

Xiaomeng Zhang

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Obviously Strategyproof Mechanisms without Money for Scheduling.

[BibT_eX]

[DOI]

Carmine Ventre

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2017

The VCG Mechanism for Bayesian Scheduling.

[BibT_eX]

[DOI]

Yiannis Giannakopoulos

ACM Trans. Economics and Comput., 2017

2016

Limitations of Deterministic Auction Design for Correlated Bidders.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2016

Blockchain Mining Games.

[BibT_eX]

[DOI]

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

2015

Bounding the inefficiency of outcomes in generalized second price auctions.

[BibT_eX]

[DOI]

J. Econ. Theory, 2015

2014

Υπολογιστικά ζητήματα σε στρατηγικά παίγνια και διαδικασίες κοινωνικής επιλογής

[BibT_eX]

[DOI]

PhD thesis, 2014

Revenue Guarantees in the Generalized Second Price Auction.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2014

2013

Tight approximation bounds for combinatorial frugal coverage algorithms.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

2012

The Efficiency of Fair Division.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

On the efficiency of equilibria in generalized second price auctions

[BibT_eX]

[DOI]

CoRR, 2012

Revenue Guarantees in Sponsored Search Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Solution to Exchanges 9.1 puzzle: borrowing as cheaply as possible.

[BibT_eX]

[DOI]

Nikos Karanikolas

Troels Bjerre Sørensen

SIGecom Exch., 2011

On the efficiency of equilibria in generalized second price auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

The Impact of Altruism on the Efficiency of Atomic Congestion Games.

[BibT_eX]

[DOI]

Evi Papaioannou

Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

2009

An Improved Approximation Bound for Spanning Star Forest and Color Saving.

[BibT_eX]

[DOI]

Stavros Athanassopoulos

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On Low-Envy Truthful Allocations.

[BibT_eX]

[DOI]