Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvangelos Markakis
- > Home > Persons > Evangelos Markakis
Publications
- 2023
[c71]Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
:
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. WINE 2023: 41-58- [i33]Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis:
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. CoRR abs/2307.07385 (2023) - [i30]Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos:
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. CoRR abs/2309.05642 (2023) - 2021
- [j27]Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat:
Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theor. Comput. Sci. 871: 62-78 (2021) - 2020
- [j26]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. Inf. Process. Lett. 163: 106010 (2020) - [j24]Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos:
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. Theor. Comput. Sci. 841: 94-109 (2020) - [c63]Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos:
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination. AAAI 2020: 1790-1797 - 2019
- [i24]Georgios Amanatidis, Apostolos Ntokos, Evangelos Markakis:
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination. CoRR abs/1909.07650 (2019) - 2018
- [c58]Georgios Amanatidis, Georgios Birmpas, Vangelis Markakis:
Comparing Approximate Relaxations of Envy-Freeness. IJCAI 2018: 42-48 - [c57]Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. SAGT 2018: 87-99 - [i22]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
Comparing Approximate Relaxations of Envy-Freeness. CoRR abs/1806.03114 (2018) - [i21]Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. CoRR abs/1807.00317 (2018) - 2017
- [j21]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ACM Trans. Algorithms 13(4): 52:1-52:28 (2017) - [c53]Georgios Amanatidis, Georgios Birmpas, George Christodoulou, Evangelos Markakis:
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. EC 2017: 545-562 - [c52]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. WINE 2017: 1-15 - [i20]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. CoRR abs/1704.06901 (2017) - [i19]Georgios Amanatidis, Georgios Birmpas, George Christodoulou, Evangelos Markakis:
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. CoRR abs/1705.10706 (2017) - 2016
- [c49]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
On Truthful Mechanisms for Maximin Share Allocations. IJCAI 2016: 31-37 - [c48]Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat:
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. MFCS 2016: 9:1-9:13 - [c46]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. WINE 2016: 414-428 - [i18]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
On Truthful Mechanisms for Maximin Share Allocations. CoRR abs/1605.04026 (2016) - [i17]Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat:
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. CoRR abs/1606.06664 (2016) - [i16]Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis:
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. CoRR abs/1610.00901 (2016) - 2015
- [c42]Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries:
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. AAMAS 2015: 715-723 - [c40]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ICALP (1) 2015: 39-51 - [i15]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. CoRR abs/1503.00941 (2015)
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-04-21 17:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
