Georgios Amanatidis
TitleCited byYear
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
822007
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
752017
Graphic realizations of joint-degree matrices
Y Amanatidis, B Green, M Mihail
25*2008
Multiple referenda and multiwinner elections using hamming distances: Complexity and manipulability
G Amanatidis, N Barrot, J Lang, E Markakis, B Ries
Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015
222015
Comparing approximate relaxations of envy-freeness
G Amanatidis, G Birmpas, E Markakis
arXiv preprint arXiv:1806.03114, 2018
212018
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
202017
On Truthful Mechanisms for Maximin Share Allocations
G Amanatidis, G Birmpas, E Markakis
Twenty-Fifth International Joint Conference on Artificial Intelligence …, 2016
202016
Coverage, matching, and beyond: new results on budgeted mechanism design
G Amanatidis, G Birmpas, E Markakis
International Conference on Web and Internet Economics, 414-428, 2016
92016
New security models and provably-secure schemes for basic query support in outsourced databases
G Amanatidis, A Boldyreva, A O’Neill
21st Annual IFIP WG 11, 8-11, 2007
82007
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
62019
An improved envy-free cake cutting protocol for four agents
G Amanatidis, G Christodoulou, J Fearnley, E Markakis, CA Psomas, ...
International Symposium on Algorithmic Game Theory, 87-99, 2018
52018
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results
G Amanatidis, E Markakis, K Sornat
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
52016
Multiple Birds with One Stone: Beating for EFX and GMMS via Envy Cycle Elimination
G Amanatidis, A Ntokos, E Markakis
arXiv preprint arXiv:1909.07650, 2019
42019
Flexible models for complex networks
Y Amanatidis, B Green, M Mihail
Poster at Center for Algorithms Randomness and Computation, 2008
42008
Peeking behind the ordinal curtain: improving distortion via cardinal queries
G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris
arXiv preprint arXiv:1907.08165, 2019
32019
On budget-feasible mechanism design for symmetric submodular objectives
G Amanatidis, G Birmpas, E Markakis
International Conference on Web and Internet Economics, 1-15, 2017
32017
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
12019
Connected realizations of joint-degree matrices
G Amanatidis, B Green, M Mihail
Discrete Applied Mathematics 250, 65-74, 2018
12018
Maximum Nash Welfare and Other Stories About EFX
G Amanatidis, G Birmpas, A Filos-Ratsikas, A Hollender, AA Voudouris
arXiv preprint arXiv:2001.09838, 2020
2020
On Approximately Sampling and Counting Graphs with Near-Regular Degree Intervals
G Amanatidis, P Kleer
2019
The system can't perform the operation now. Try again later.
Articles 1–20