Alkmini Sgouritsa

Orcid: 0000-0003-3997-5131

According to our database1, Alkmini Sgouritsa authored at least 19 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Improved Upper Bound for the Universal TSP on the Grid.
SIAM J. Comput., 2024

Resource-Aware Cost-Sharing Methods for Scheduling Games.
Oper. Res., 2024

Mechanism design augmented with output advice.
CoRR, 2024

Pushing the Frontier on Approximate EFX Allocations.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023
Fair allocation in graphs.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Improved Price of Anarchy via Predictions.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
A Little Charity Guarantees Almost Envy-Freeness.
SIAM J. Comput., 2021

Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Resource-Aware Cost-Sharing Mechanisms with Priors.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020
Resource-Aware Protocols for Network Cost-Sharing Games.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

A General Framework for Energy-Efficient Cloud Computing Mechanisms.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Designing Networks with Good Equilibria under Uncertainty.
SIAM J. Comput., 2019

Designing Cost-Sharing Methods for Bayesian Games.
Theory Comput. Syst., 2019

2018
On the Efficiency of All-Pay Mechanisms.
Algorithmica, 2018

2017
Algorithms for game-theoretic environments.
PhD thesis, 2017

Cost-Sharing Methods for Scheduling Games under Uncertainty.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions.
ACM Trans. Economics and Comput., 2016

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources.
Theory Comput. Syst., 2016

2015
Universal Network Cost-Sharing Design.
CoRR, 2015


  Loading...