Georgios Amanatidis

Available identifiers

zbMath Open amanatidis.georgiosMaRDI QIDQ1617646

List of research outcomes

Publication	Date of Publication	Type
Approximate sampling and counting of graphs with near-regular degree intervals	2024-11-27	Paper
Approximate sampling and counting of graphs with near-regular degree intervals	2024-10-08	Paper
Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents	2024-09-20	Paper
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond	2024-03-14	Paper
Fair division of indivisible goods: recent progress and open questions	2023-08-28	Paper
Decentralized update selection with semi-strategic experts	2023-07-28	Paper
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online	2022-09-26	Paper
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint	2022-08-02	Paper
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching	2022-08-02	Paper
Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness	2022-07-06	Paper
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices	2022-01-07	Paper
Peeking behind the ordinal curtain: improving distortion via cardinal queries	2021-11-02	Paper
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals	2021-10-18	Paper
Inequity aversion pricing over social networks: approximation algorithms and hardness results	2021-06-08	Paper
Maximum Nash welfare and other stories about EFX	2021-03-18	Paper
Rapid mixing of the switch Markov chain for strongly stable degree sequences	2020-11-30	Paper
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint	2020-10-07	Paper
Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination	2020-09-17	Paper
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices	2019-10-15	Paper
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives	2019-01-30	Paper
Approximation Algorithms for Computing Maximin Share Allocations	2018-11-12	Paper
An improved envy-free cake cutting protocol for four agents	2018-11-08	Paper
Connected realizations of joint-degree matrices	2018-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q4608566	2018-03-21	Paper
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design	2017-02-10	Paper
Approximation Algorithms for Computing Maximin Share Allocations	2015-10-27	Paper

Research outcomes over time

This page was built for person: Georgios Amanatidis