The following pages link to Georgios Amanatidis (Q1617646):
Displaying 21 items.
- An improved envy-free cake cutting protocol for four agents (Q1617649) (← links)
- Connected realizations of joint-degree matrices (Q1801046) (← links)
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Peeking behind the ordinal curtain: improving distortion via cardinal queries (Q2238590) (← links)
- Maximum Nash welfare and other stories about EFX (Q2658044) (← links)
- Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design (Q2959848) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q4554942) (← links)
- (Q4608566) (← links)
- On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives (Q4614052) (← links)
- Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices (Q5020837) (← links)
- A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching (Q5094013) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Rapid mixing of the switch Markov chain for strongly stable degree sequences (Q5136927) (← links)
- Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices (Q5236244) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond (Q6195958) (← links)
