![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Alkmini Sgouritsa
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]George Christodoulou
, Vasilis Gkatzelis
, Alkmini Sgouritsa
:
Resource-Aware Cost-Sharing Methods for Scheduling Games. Oper. Res. 72(1): 167-184 (2024) - [i10]Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa:
Pushing the Frontier on Approximate EFX Allocations. CoRR abs/2406.12413 (2024) - [i9]George Christodoulou, Alkmini Sgouritsa, Ioannis Vlachos:
Mechanism design augmented with output advice. CoRR abs/2406.14165 (2024) - 2023
- [c13]George Christodoulou
, Amos Fiat
, Elias Koutsoupias
, Alkmini Sgouritsa
:
Fair allocation in graphs. EC 2023: 473-488 - 2022
- [c12]Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, Xizhi Tan:
Improved Price of Anarchy via Predictions. EC 2022: 529-557 - [i8]Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, Xizhi Tan:
Improved Price of Anarchy via Predictions. CoRR abs/2205.04252 (2022) - 2021
- [j6]Bhaskar Ray Chaudhury
, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. 50(4): 1336-1358 (2021) - [c11]Vasilis Gkatzelis, Emmanouil Pountourakis, Alkmini Sgouritsa:
Resource-Aware Cost-Sharing Mechanisms with Priors. EC 2021: 541-559 - [c10]Evangelos Markakis, Alkmini Sgouritsa, Artem Tsikiridis
:
Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction. WINE 2021: 186-204 - [i7]Vasilis Gkatzelis, Emmanouil Pountourakis, Alkmini Sgouritsa:
Resource-Aware Cost-Sharing Mechanisms with Priors. CoRR abs/2106.01588 (2021) - 2020
- [c9]Antonios Antoniadis, Andrés Cristi, Tim Oosterwijk, Alkmini Sgouritsa:
A General Framework for Energy-Efficient Cloud Computing Mechanisms. AAMAS 2020: 70-78 - [c8]George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian, Alkmini Sgouritsa:
Resource-Aware Protocols for Network Cost-Sharing Games. EC 2020: 81-107 - [c7]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SODA 2020: 2658-2672 - [i6]George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian, Alkmini Sgouritsa:
Resource-Aware Protocols for Network Cost-Sharing Games. CoRR abs/2007.03751 (2020)
2010 – 2019
- 2019
- [j5]George Christodoulou
, Stefano Leonardi, Alkmini Sgouritsa
:
Designing Cost-Sharing Methods for Bayesian Games. Theory Comput. Syst. 63(1): 4-25 (2019) - [j4]George Christodoulou
, Alkmini Sgouritsa:
Designing Networks with Good Equilibria under Uncertainty. SIAM J. Comput. 48(4): 1364-1396 (2019) - [i5]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. CoRR abs/1907.04596 (2019) - 2018
- [j3]George Christodoulou
, Alkmini Sgouritsa, Bo Tang
:
On the Efficiency of All-Pay Mechanisms. Algorithmica 80(4): 1115-1145 (2018) - 2017
- [b1]Alkmini Sgouritsa:
Algorithms for game-theoretic environments. University of Liverpool, UK, 2017 - [c6]Giorgos Christodoulou, Vasilis Gkatzelis, Alkmini Sgouritsa:
Cost-Sharing Methods for Scheduling Games under Uncertainty. EC 2017: 441-458 - [c5]George Christodoulou, Alkmini Sgouritsa:
An Improved Upper Bound for the Universal TSP on the Grid. SODA 2017: 1006-1021 - 2016
- [j2]George Christodoulou
, Alkmini Sgouritsa
, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. Theory Comput. Syst. 59(4): 600-618 (2016) - [j1]George Christodoulou
, Annamária Kovács, Alkmini Sgouritsa, Bo Tang:
Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions. ACM Trans. Economics and Comput. 4(2): 9:1-9:33 (2016) - [c4]George Christodoulou
, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. SAGT 2016: 327-339 - [c3]George Christodoulou, Alkmini Sgouritsa:
Designing Networks with Good Equilibria under Uncertainty. SODA 2016: 72-89 - 2015
- [c2]George Christodoulou
, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of All-Pay Mechanisms. ESA 2015: 349-360 - [c1]George Christodoulou
, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. SAGT 2015: 165-177 - [i4]George Christodoulou, Alkmini Sgouritsa:
Universal Network Cost-Sharing Design. CoRR abs/1503.03392 (2015) - [i3]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. CoRR abs/1507.07011 (2015) - [i2]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of All-Pay Mechanisms. CoRR abs/1508.01130 (2015) - 2013
- [i1]George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang:
Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions. CoRR abs/1312.2371 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint