| Approximation algorithms for computing maximin share allocations G Amanatidis, E Markakis, A Nikzad, A Saberi ACM Transactions on Algorithms (TALG) 13 (4), 1-28, 2017 | 201 | 2017 |
| Fair Division of Indivisible Goods: Recent Progress and Open Questions G Amanatidis, H Aziz, G Birmpas, A Filos-Ratsikas, B Li, H Moulin, ... Artificial Intelligence, 103965, 2023 | 200* | 2023 |
| Maximum Nash welfare and other stories about EFX G Amanatidis, G Birmpas, A Filos-Ratsikas, A Hollender, AA Voudouris Theoretical Computer Science 863, 69-85, 2021 | 131 | 2021 |
| Provably-secure schemes for basic query support in outsourced databases G Amanatidis, A Boldyreva, A O’Neill IFIP Annual Conference on Data and Applications Security and Privacy, 14-30, 2007 | 109 | 2007 |
| Truthful allocation mechanisms without payments: Characterization and implications on fairness G Amanatidis, G Birmpas, G Christodoulou, E Markakis Proceedings of the 2017 ACM Conference on Economics and Computation, 545-562, 2017 | 84 | 2017 |
| Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination G Amanatidis, E Markakis, A Ntokos Theoretical Computer Science 841, 94-109, 2020 | 81 | 2020 |
| Comparing approximate relaxations of envy-freeness G Amanatidis, G Birmpas, E Markakis arXiv preprint arXiv:1806.03114, 2018 | 77 | 2018 |
| On Truthful Mechanisms for Maximin Share Allocations G Amanatidis, G Birmpas, E Markakis Twenty-Fifth International Joint Conference on Artificial Intelligence …, 2016 | 68 | 2016 |
| Peeking behind the ordinal curtain: Improving distortion via cardinal queries G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris Artificial Intelligence 296, 103488, 2021 | 54 | 2021 |
| Fast adaptive non-monotone submodular maximization subject to a knapsack constraint G Amanatidis, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser Journal of Artificial Intelligence Research 74, 661-690, 2022 | 49 | 2022 |
| Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. G Amanatidis, N Barrot, J Lang, E Markakis, B Ries AAMAS 15, 715-723, 2015 | 37 | 2015 |
| Graphic realizations of joint-degree matrices G Amanatidis, B Green, M Mihail arXiv preprint arXiv:1509.07076, 2015 | 32* | 2015 |
| Budget-feasible mechanism design for non-monotone submodular objectives: Offline and online G Amanatidis, P Kleer, G Schäfer Proceedings of the 2019 ACM Conference on Economics and Computation, 901-919, 2019 | 30 | 2019 |
| A few queries go a long way: Information-distortion tradeoffs in matching G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris Journal of Artificial Intelligence Research 74, 227–261-227–261, 2022 | 26 | 2022 |
| Coverage, matching, and beyond: new results on budgeted mechanism design G Amanatidis, G Birmpas, E Markakis Web and Internet Economics: 12th International Conference, WINE 2016 …, 2016 | 25 | 2016 |
| On budget-feasible mechanism design for symmetric submodular objectives G Amanatidis, G Birmpas, E Markakis Web and Internet Economics: 13th International Conference, WINE 2017 …, 2017 | 23 | 2017 |
| Rapid mixing of the switch Markov chain for strongly stable degree sequences and 2-class joint degree matrices G Amanatidis, P Kleer Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 21 | 2019 |
| Allocating indivisible goods to strategic agents: Pure nash equilibria and fairness G Amanatidis, G Birmpas, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser Mathematics of Operations Research, 2023 | 17 | 2023 |
| An improved envy-free cake cutting protocol for four agents G Amanatidis, G Christodoulou, J Fearnley, E Markakis, CA Psomas, ... Algorithmic Game Theory: 11th International Symposium, SAGT 2018, Beijing …, 2018 | 17 | 2018 |
| Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris SIAM Journal on Discrete Mathematics 38 (1), 1007-1029, 2024 | 14 | 2024 |
Georgios BirmpasUniversity of LiverpoolVerified email at liverpool.ac.uk
