Dr Georgios Amanatidis
-
Email
georgios.amanatidis@essex.ac.uk -
Telephone
+44 (0) 1206 872689
-
Location
3A.527, Colchester Campus
Profile
Biography
I am a Senior Lecturer (Associate Professor) at the School of Mathematics, Statistics and Actuarial Science of the University of Essex. I enjoy working on problems lying in the intersection of computer science and economics, often related to social choice theory. I have a particular interest in fair division and in algorithmic mechanism design. I am the PI of the NWO VENI project “Algorithmic Fair Division in Dynamic, Socially Constrained Environments”. I completed my PhD in 2017 at Athens University of Economics and Business. Before joining Essex, I worked as a postdoctoral researcher at the Sapienza University of Rome and at the Centrum Wiskunde & Informatica (CWI). Until very recently, I was also affiliated with the Institute for Logic, Language and Computation of the University of Amsterdam as an associate member of the Computational Social Choice Group. For more information about my research, please visit my personal page.
Qualifications
-
PhD in Computer Science Athens University of Economics and Business,
-
MSc in Mathematics Georgia Institute of Technology,
-
Diploma (5-year degree) in Applied Mathematical and Physical Sciences National Technical University of Athens,
Appointments
University of Essex
-
Lecturer in Mathematics, Department of Mathematical Sciences, University of Essex (1/4/2020 - 30/9/2023)
-
Senior Lecturer, School of Mathematics, Statistics and Actuarial Science, University of Essex (1/10/2023 - present)
Other academic
-
Postdoctoral Researcher (part-time appointment), Institute for Logic, Language and Computation, University of Amsterdam (1/4/2020 - 31/3/2021)
-
Senior Postdoctoral Researcher, Department of Computer, Control and Management Engineering, Sapienza University of Rome (1/9/2019 - 30/6/2020)
-
Postdoctoral Researcher, Networks and Optimization, Centrum Wiskunde and Informatica (1/9/2017 - 31/8/2019)
Research and professional activities
Research interests
Algorithmic Game theory
Fair Division, Mechanism Design, Voting
Graph Theory
Graph Algorithms, Sampling and Counting
Discrete Optimization
Submodular Optimization, Approximation Algorithms
Teaching and supervision
Current teaching responsibilities
-
Mechanics and Relativity (MA105)
-
Mathematics Careers and Employability (MA199)
-
Combinatorial Optimisation (MA306)
Publications
Publications (4)
Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2024). Algorithmically Fair Maximization of Multiple Submodular Objective Functions
Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2023). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Amanatidis, G., Filos-Ratsikas, A., Lazos, P., Markakis, E. and Papasotiropoulos, G., (2023). On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
Amanatidis, G., Klumper, S., Markakis, E., Schäfer, G. and Tsikiridis, A., (2023). Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
Journal articles (16)
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, A., (2024). Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. SIAM Journal on Discrete Mathematics. 38 (1), 1007-1029
Amanatidis, G., Aziz, H., Birmpas, G., Filos-Ratsikas, A., Li, B., Moulin, H., Voudouris, AA. and Wu, X., (2023). Fair division of indivisible goods: Recent progress and open questions. Artificial Intelligence. 322, 103965-103965
Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2023). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. Mathematics of Operations Research
Amanatidis, G. and Kleer, P., (2022). Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices. SIAM Journal on Discrete Mathematics. 36 (1), 118-146
Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2022). Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. Journal of Artificial Intelligence Research. 74, 661-690
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, A., (2022). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. Journal of Artificial Intelligence Research. 74, 227-261
Amanatidis, G., Kleer, P. and Schäfer, G., (2022). Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online. Mathematics of Operations Research. 47 (3), 2286-2309
Amanatidis, G., Fulla, P., Markakis, E. and Sornat, K., (2021). Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theoretical Computer Science. 871, 62-78
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A. and Voudouris, AA., (2021). Maximum Nash welfare and other stories about EFX. Theoretical Computer Science. 863, 69-85
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, AA., (2021). Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries. Artificial Intelligence. 296, 103488-103488
Amanatidis, G. and Kleer, P., (2020). Rapid mixing of the switch Markov chain for strongly stable degree sequences. Random Structures and Algorithms. 57 (3), 637-657
Amanatidis, G., Birmpas, G. and Markakis, E., (2020). A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. Information Processing Letters. 163, 106010-106010
Amanatidis, G., Markakis, E. and Ntokos, A., (2020). Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. Theoretical Computer Science. 841, 94-109
Amanatidis, G., Green, B. and Mihail, M., (2018). Connected realizations of joint-degree matrices. Discrete Applied Mathematics. 250, 65-74
Amanatidis, G., Markakis, E., Nikzad, A. and Saberi, A., (2017). Approximation Algorithms for Computing Maximin Share Allocations. ACM Transactions on Algorithms. 13 (4), 1-28
Amanatidis, G., Markakis, E., Nikzad, A. and Saberi, A., (2017). Approximation Algorithms for Computing Maximin Share Allocations. Trends in Mathematics. 6, 55-59
Book chapters (1)
Amanatidis, G. and Kleer, P., (2019). Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. 966- 985
Conferences (23)
Amanatidis, G., Klumper, S., Markakis, E., Schäfer, G. and Tsikiridis, A., (2024). Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
Amanatidis, G. and Kleer, P., (2023). Approximately Sampling and Counting Graphs with Near-Regular Degree Intervals
Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2023). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S. and Reiffenhauser, R., (2022). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, AA., (2022). Fair Division of Indivisible Goods: A Survey
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, A., (2022). Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, AA., (2022). Fair Division of Indivisible Goods: A Survey
Amanatidis, G., Birmpas, G., Lazos, P. and Marmolejo-Cossío, F., (2022). Decentralized Update Selection with Semi-strategic Experts
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A. and Voudouris, AA., (2021). Maximum Nash Welfare and Other Stories About EFX
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, AA., (2021). A few queries go a long way: Information-distortion tradeoffs in matching
Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Marchetti-Spaccamela, A. and Reiffenhauser, R., (2021). Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-Optimal Adaptive Complexity
Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Marchetti-Spaccamela, A. and Reiffenhäuser, R., (2021). Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-Optimal Adaptive Complexity
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, AA., (2020). Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2020). Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Amanatidis, G., Markakis, E. and Ntokos, A., (2020). Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Voudouris, AA. and Intelligence, AAA., (2020). Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
Amanatidis, G., Kleer, P. and Schäfer, G., (2019). Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives
Amanatidis, G., Birmpas, G. and Markakis, V., (2018). Comparing Approximate Relaxations of Envy-Freeness
Amanatidis, G., Birmpas, G., Christodoulou, G. and Markakis, E., (2017). Truthful Allocation Mechanisms Without Payments
Amanatidis, G., Markakis, E. and Sornat, K., (2016). Inequity aversion pricing over social networks: Approximation algorithms and hardness results
Amanatidis, G., Barrot, N., Lang, J., Markakis, E. and Ries, B., (2015). Multiple referenda and multiwinner elections using Hamming distances: Complexity and manipulability
Amanatidis, G., Markakis, E., Nikzad, A. and Saberi, A., (2015). Approximation Algorithms for Computing Maximin Share Allocations
Amanatidis, G., Boldyreva, A. and O’Neill, A., (2007). Provably-Secure Schemes for Basic Query Support in Outsourced Databases
Reports and Papers (10)
Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S. and Reiffenhauser, R., (2022). Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S. and Reiffenhäuser, R., (2022). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A. and Voudouris, AA., (2022). Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
Amanatidis, G., Aziz, H., Birmpas, G., Filos-Ratsikas, A., Li, B., Moulin, H., Voudouris, AA. and Wu, X., (2022). Fair Division of Indivisible Goods: Recent Progress and Open Questions
Amanatidis, G. and Kleer, P., (2021). Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
Amanatidis, G., Christodoulou, G., Fearnley, J., Markakis, E., Psomas, C-A. and Vakaliou, E., (2018). An Improved Envy-Free Cake Cutting Protocol for Four Agents
Amanatidis, G., Birmpas, G. and Markakis, E., (2017). On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives
Amanatidis, G., Birmpas, G. and Markakis, E., (2016). On truthful mechanisms for maximin share allocations
Amanatidis, G., Birmpas, G. and Markakis, E., (2016). Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design
Amanatidis, G., Green, B. and Mihail, M., (2015). Graphic Realizations of Joint-Degree Matrices
Grants and funding
2021
Algorithmic Fair Division in Dynamic, Socially Constrained Environments
NWO Dutch Research Council
