Dr Alkmini Sgouritsa

Computer Science

Work email A.Sgouritsa2@liverpool.ac.uk
Personal Websitehttps://sites.google.com/site/alkminisgouritsa/home

Publications

Filter the publication list

Filter list by type

Show all
Journal article
Conference paper
Chapter
Other

2024

Resource-Aware Cost-Sharing Methods for Scheduling Games (Journal article)

Christodoulou, G., Gkatzelis, V., & Sgouritsa, A. (2023). Resource-Aware Cost-Sharing Methods for Scheduling Games. OPERATIONS RESEARCH. doi:10.1287/opre.2023.2434

DOI: 10.1287/opre.2023.2434

2023

Fair allocation in graphs (Conference Paper)

Christodoulou, G., Fiat, A., Koutsoupias, E., & Sgouritsa, A. (2023). Fair allocation in graphs. In Proceedings of the 24th ACM Conference on Economics and Computation. ACM. doi:10.1145/3580507.3597764

DOI: 10.1145/3580507.3597764

2022

Improved Price of Anarchy via Predictions (Conference Paper)

Gkatzelis, V., Kollias, K., Sgouritsa, A., & Tan, X. (2022). Improved Price of Anarchy via Predictions. In Proceedings of the 23rd ACM Conference on Economics and Computation. ACM. doi:10.1145/3490486.3538296

DOI: 10.1145/3490486.3538296

Improved Price of Anarchy via Predictions (Preprint)

Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction (Conference Paper)

Markakis, E., Sgouritsa, A., & Tsikiridis, A. (2022). Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction. In WEB AND INTERNET ECONOMICS, WINE 2021 Vol. 13112 (pp. 186-204). doi:10.1007/978-3-030-94676-0_11

DOI: 10.1007/978-3-030-94676-0_11

2021

A LITTLE CHARITY GUARANTEES ALMOST ENVY-FREENESS (Journal article)

Sgouritsa, A., RAY CHAUDHURY, B., TELIKEPALLI, K., & MEHLHORN, K. (2021). A LITTLE CHARITY GUARANTEES ALMOST ENVY-FREENESS. SIAM Journal on Computing. doi:10.1137/20M1359134

DOI: 10.1137/20M1359134

Resource-Aware Cost-Sharing Mechanisms with Priors (Conference Paper)

Gkatzelis, V., Pountourakis, E., & Sgouritsa, A. (2021). Resource-Aware Cost-Sharing Mechanisms with Priors. Retrieved from http://arxiv.org/abs/2106.01588v1

Resource-Aware Cost-Sharing Mechanisms with Priors. (Conference Paper)

Gkatzelis, V., Pountourakis, E., & Sgouritsa, A. (2021). Resource-Aware Cost-Sharing Mechanisms with Priors.. In P. Biró, S. Chawla, & F. Echenique (Eds.), EC (pp. 541-559). ACM. Retrieved from https://doi.org/10.1145/3465456

2020

Resource-Aware Protocols for Network Cost-Sharing Games (Conference Paper)

Christodoulou, G., Gkatzelis, V., Latifian, M., & Sgouritsa, A. (2020). Resource-Aware Protocols for Network Cost-Sharing Games. Retrieved from http://dx.doi.org/10.1145/3391403.3399528

Resource-Aware Protocols for Network Cost-Sharing Games. (Journal article)

Christodoulou, G., Gkatzelis, V., Latifian, M., & Sgouritsa, A. (2020). Resource-Aware Protocols for Network Cost-Sharing Games.. CoRR. doi:10.1145/3391403.3399528

DOI: 10.1145/3391403.3399528

A Little Charity Guarantees Almost Envy-Freeness (Conference Paper)

Chaudhury, B. R., Kavitha, T., Mehlhorn, K., & Sgouritsa, A. (2020). A Little Charity Guarantees Almost Envy-Freeness. In SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2658-2672). Salt Lake City Utah: ACM. doi:10.1137/1.9781611975994.162

DOI: 10.1137/1.9781611975994.162

A Little Charity Guarantees Almost Envy-Freeness. (Conference Paper)

Chaudhury, B. R., Kavitha, T., Mehlhorn, K., & Sgouritsa, A. (2020). A Little Charity Guarantees Almost Envy-Freeness.. In S. Chawla (Ed.), SODA (pp. 2658-2672). SIAM. Retrieved from https://doi.org/10.1137/1.9781611975994

A general framework for energy-efficient cloud computing mechanisms (Conference Paper)

Antoniadis, A., Cristi, A., Oosterwijk, T., & Sgouritsa, A. (2020). A general framework for energy-efficient cloud computing mechanisms. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS Vol. 2020-May (pp. 70-78).

2019

Designing Cost-Sharing Methods for Bayesian Games. (Journal article)

Christodoulou, G., Leonardi, S., & Sgouritsa, A. (2019). Designing Cost-Sharing Methods for Bayesian Games. THEORY OF COMPUTING SYSTEMS, 63(1), 4-25. doi:10.1007/s00224-017-9832-3

Designing Networks with Good Equilibria under Uncertainty (Journal article)

Christodoulou, G., & Sgouritsa, A. (2019). Designing Networks with Good Equilibria under Uncertainty. SIAM Journal on Computing, 48(4), 1364-1396. doi:10.1137/16M1096694

DOI: 10.1137/16M1096694

2018

On the Efficiency of All-Pay Mechanisms (Journal article)

Christodoulou, G., Sgouritsa, A., & Tang, B. (2018). On the Efficiency of All-Pay Mechanisms. ALGORITHMICA, 80(4), 1115-1145. doi:10.1007/s00453-017-0296-2

DOI: 10.1007/s00453-017-0296-2

2017

Cost-Sharing Methods for Scheduling Games under Uncertainty (Conference Paper)

Christodoulou, G., Sgouritsa, A., & Gkatzelis, V. (2017). Cost-Sharing Methods for Scheduling Games under Uncertainty. In EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation (pp. 441-458).

Algorithms for Game-Theoretic Environments (Thesis / Dissertation)

Sgouritsa, A. (2017). Algorithms for Game-Theoretic Environments. (the University of Liverpool).

An Improved Upper Bound for the Universal TSP on the Grid (Conference Paper)

Christodoulou, G., & Sgouritsa, A. (2017). An Improved Upper Bound for the Universal TSP on the Grid. In Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1006). Barcelona.

2016

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources (Journal article)

Christodoulou, G., Sgouritsa, A., & Tang, B. (2016). On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. THEORY OF COMPUTING SYSTEMS, 59(4), 600-618. doi:10.1007/s00224-016-9701-5

DOI: 10.1007/s00224-016-9701-5

Designing Cost-Sharing Methods for Bayesian Games (Conference Paper)

Christodoulou, G., Leonardi, S., & Sgouritsa, A. (2016). Designing Cost-Sharing Methods for Bayesian Games. In ALGORITHMIC GAME THEORY, SAGT 2016 Vol. 9928 (pp. 327-339). doi:10.1007/978-3-662-53354-3_26

DOI: 10.1007/978-3-662-53354-3_26

2015

On the Efficiency of All-Pay Mechanisms (Conference Paper)

Christodoulou, G., Sgouritsa, A., & Tang, B. (2015). On the Efficiency of All-Pay Mechanisms. In ALGORITHMS - ESA 2015 Vol. 9294 (pp. 349-360). doi:10.1007/978-3-662-48350-3_30

DOI: 10.1007/978-3-662-48350-3_30

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources (Journal article)

Christodoulou, G., Sgouritsa, A., & Tang, B. (2015). On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. ALGORITHMIC GAME THEORY, SAGT 2015, 9347, 165-177. doi:10.1007/978-3-662-48433-3_13

DOI: 10.1007/978-3-662-48433-3_13

Designing Networks with Good Equilibria under Uncertainty (Conference Paper)

Christodoulou, G., & Sgouritsa, A. (2015). Designing Networks with Good Equilibria under Uncertainty. Retrieved from http://arxiv.org/abs/1503.03392v2

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. (Conference Paper)

Christodoulou, G., Sgouritsa, A., & Tang, B. (2015). On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources.. In M. Hoefer (Ed.), SAGT Vol. 9347 (pp. 165-177). Springer. Retrieved from https://doi.org/10.1007/978-3-662-48433-3

Universal Network Cost-Sharing Design. (Journal article)

Christodoulou, G., & Sgouritsa, A. (2015). Universal Network Cost-Sharing Design.. CoRR, abs/1503.03392.

2013

Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions. (Journal article)

Christodoulou, G., Kovacs, A., Sgouritsa, A., & Tang, B. (2016). Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions.. ACM Transactions on Economics and Computation, 4(2). doi:10.1145/2847520

DOI: 10.1145/2847520