Spremljaj
Georgios Amanatidis
Georgios Amanatidis
Lecturer in Mathematics, Department of Mathematical Sciences, University of Essex
Preverjeni e-poštni naslov na essex.ac.uk - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
1722017
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
1042007
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
902021
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
78*2023
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
682017
Comparing approximate relaxations of envy-freeness
G Amanatidis, G Birmpas, E Markakis
arXiv preprint arXiv:1806.03114, 2018
602018
On Truthful Mechanisms for Maximin Share Allocations
G Amanatidis, G Birmpas, E Markakis
Twenty-Fifth International Joint Conference on Artificial Intelligence …, 2016
592016
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
522020
Peeking behind the ordinal curtain: Improving distortion via cardinal queries
G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris
Artificial Intelligence 296, 103488, 2021
402021
Fast adaptive non-monotone submodular maximization subject to a knapsack constraint
G Amanatidis, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser
Advances in neural information processing systems 33, 16903-16915, 2020
322020
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
302015
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
222016
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
202019
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
202019
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
192017
Graphic realizations of joint-degree matrices
G Amanatidis, B Green, M Mihail
arXiv preprint arXiv:1509.07076, 2015
192015
Graphic realizations of joint-degree matrices
Y Amanatidis, B Green, M Mihail
Unpublished manuscript, 2008
192008
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
162022
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
142018
Inequity aversion pricing over social networks: Approximation algorithms and hardness results
G Amanatidis, P Fulla, E Markakis, K Sornat
Theoretical Computer Science 871, 62-78, 2021
132021
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20