Georgios Amanatidis

Orcid: 0000-0002-4341-5439

Affiliations:
  • 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:

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
Other 

Links

Online presence:

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

Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.
SIAM J. Discret. Math., 2024

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
Math. Oper. Res., 2024

On the Tractability Landscape of Conditional Minisum Approval Voting Rule.
CoRR, 2024

Pandora's Box Problem Over Time.
CoRR, 2024

Metric Distortion under Group-Fair Objectives.
CoRR, 2024

Algorithmically Fair Maximization of Multiple Submodular Objective Functions.
CoRR, 2024

Pushing the Frontier on Approximate EFX Allocations.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Fair division of indivisible goods: Recent progress and open questions.
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
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices.
SIAM J. Discret. Math., 2022

Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.
Math. Oper. Res., 2022

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
J. Artif. Intell. Res., 2022

A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching.
J. Artif. Intell. Res., 2022

Fair Division of Indivisible Goods: A Survey.
CoRR, 2022

Decentralised Update Selection with Semi-Strategic Experts.
CoRR, 2022

Decentralized Update Selection with Semi-strategic Experts.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Fair Division of Indivisible Goods: A Survey.
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

Maximum Nash welfare and other stories about EFX.
Theor. Comput. Sci., 2021

Peeking behind the ordinal curtain: Improving distortion via cardinal queries.
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

Rapid mixing of the switch Markov chain for strongly stable degree sequences.
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
Connected realizations of joint-degree matrices.
Discret. Appl. Math., 2018

An Improved Envy-Free Cake Cutting Protocol for Four Agents.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Comparing Approximate Relaxations of Envy-Freeness.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Algorithmic and mechanism design aspects of problems with limited or non-payments
PhD thesis, 2017

Approximation Algorithms for Computing Maximin Share Allocations.
ACM Trans. Algorithms, 2017

On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives.
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
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design.
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

On Truthful Mechanisms for Maximin Share Allocations.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Graphic Realizations of Joint-Degree Matrices.
CoRR, 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
Provably-Secure Schemes for Basic Query Support in Outsourced Databases.
Proceedings of the Data and Applications Security XXI, 2007


  Loading...