Georgios Amanatidis

From MaRDI portal
Person:1617646

Available identifiers

zbMath Open amanatidis.georgiosMaRDI QIDQ1617646

List of research outcomes





PublicationDate of PublicationType
Approximate sampling and counting of graphs with near-regular degree intervals2024-11-27Paper
Approximate sampling and counting of graphs with near-regular degree intervals2024-10-08Paper
Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents2024-09-20Paper
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond2024-03-14Paper
Fair division of indivisible goods: recent progress and open questions2023-08-28Paper
Decentralized update selection with semi-strategic experts2023-07-28Paper
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online2022-09-26Paper
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint2022-08-02Paper
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching2022-08-02Paper
Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness2022-07-06Paper
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices2022-01-07Paper
Peeking behind the ordinal curtain: improving distortion via cardinal queries2021-11-02Paper
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals2021-10-18Paper
Inequity aversion pricing over social networks: approximation algorithms and hardness results2021-06-08Paper
Maximum Nash welfare and other stories about EFX2021-03-18Paper
Rapid mixing of the switch Markov chain for strongly stable degree sequences2020-11-30Paper
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint2020-10-07Paper
Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination2020-09-17Paper
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices2019-10-15Paper
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives2019-01-30Paper
Approximation Algorithms for Computing Maximin Share Allocations2018-11-12Paper
An improved envy-free cake cutting protocol for four agents2018-11-08Paper
Connected realizations of joint-degree matrices2018-10-26Paper
https://portal.mardi4nfdi.de/entity/Q46085662018-03-21Paper
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design2017-02-10Paper
Approximation Algorithms for Computing Maximin Share Allocations2015-10-27Paper

Research outcomes over time

This page was built for person: Georgios Amanatidis