activity
20152026
most citedApproximation Algorithms for Computing Maximin Share Allocations

128 citations · 451 across the 30 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

cs.GT2024

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule

Georgios Amanatidis, Michael Lampis, Evangelos Markakis +1

This work examines the Conditional Approval Framework for elections involving multiple interdependent issues, specifically focusing on the Conditional Minisum Approval Voting Rule.…

cs.GT2024

Pandora's Box Problem With Time Constraints

Georgios Amanatidis, Ben Berger, Tomer Ezra +4

The Pandora's Box problem models the search for the best alternative when evaluation is costly. In the simplest variant, a decision maker is presented with boxes, each associat…

cs.GT2024★ 1 cited

Pushing the Frontier on Approximate EFX Allocations

Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa

We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good (-…

cs.GT2024

Metric Distortion under Group-Fair Objectives

Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett +1

We consider a voting problem in which a set of agents have metric preferences over a set of alternatives, and are also partitioned into disjoint groups. Given information about the…

cs.DS2024

Algorithmically Fair Maximization of Multiple Submodular Objective Functions and Implications to Constrained Fair Division

Georgios Amanatidis, Georgios Birmpas, Philip Lazos +2

Constrained maximization of submodular functions is a central problem in combinatorial optimization. In many realistic scenarios, multiple agents each need to maximize their own su…