Georgios Amanatidis
Orcid: 0000-0002-4341-5439Affiliations:
- Athens University of Economics and Business, Greece
- University of Essex, UK (former)
- Sapienza Università di Roma, Italy (former)
According to our database1,
Georgios Amanatidis
authored at least 41 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
10
7
1
6
3
3
1
1
1
2
2
2
1
1
2
2
3
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond.
SIAM J. Discret. Math., March, 2024
SIAM J. Discret. Math., 2024
Math. Oper. Res., 2024
CoRR, 2024
CoRR, 2024
Proceedings of the 25th ACM Conference on Economics and Computation, 2024
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
2023
Artif. Intell., September, 2023
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
2022
SIAM J. Discret. Math., 2022
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.
Math. Oper. Res., 2022
J. Artif. Intell. Res., 2022
J. Artif. Intell. Res., 2022
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
2021
Inequity aversion pricing over social networks: Approximation algorithms and hardness results.
Theor. Comput. Sci., 2021
Artif. Intell., 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination.
Theor. Comput. Sci., 2020
Random Struct. Algorithms, 2020
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.
Inf. Process. Lett., 2020
2019
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
2018
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
2017
PhD thesis, 2017
ACM Trans. Algorithms, 2017
Proceedings of the Web and Internet Economics - 13th International Conference, 2017
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
Proceedings of the Web and Internet Economics - 12th International Conference, 2016
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
2015
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
2007
Proceedings of the Data and Applications Security XXI, 2007