Georgios Amanatidis
Georgios Amanatidis
Lecturer, Department of Mathematical Sciences, University of Essex
Verified email at essex.ac.uk - Homepage
Title
Cited by
Cited by
Year
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
872017
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
832007
Comparing approximate relaxations of envy-freeness
G Amanatidis, G Birmpas, E Markakis
arXiv preprint arXiv:1806.03114, 2018
272018
Graphic realizations of joint-degree matrices
Y Amanatidis, B Green, M Mihail
27*2008
On Truthful Mechanisms for Maximin Share Allocations
G Amanatidis, G Birmpas, E Markakis
Twenty-Fifth International Joint Conference on Artificial Intelligence …, 2016
242016
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
232017
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
232015
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
112016
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
82019
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
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination.
G Amanatidis, E Markakis, A Ntokos
AAAI, 1790-1797, 2020
62020
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries.
G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris
AAAI, 1782-1789, 2020
62020
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
62018
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
62016
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
52020
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
42017
Flexible models for complex networks
Y Amanatidis, B Green, M Mihail
Poster at Center for Algorithms Randomness and Computation, 2008
42008
Connected realizations of joint-degree matrices
G Amanatidis, B Green, M Mihail
Discrete Applied Mathematics 250, 65-74, 2018
22018
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
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences
G Amanatidis, P Kleer
arXiv preprint arXiv:1803.01338, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20