activity
20022026
most citedApproximation Algorithms for Computing Maximin Share Allocations

128 citations · 377 across the 44 of their papers we have counts for

collaborators

49 papers

cs.GT2026

Improved Last-iterate Convergence Properties for the FLBR-MWU Dynamics

Michail Fasoulakis, Evangelos Markakis, Giorgos Roussakis +1

We revisit a variant of Multiplicative Weights Update (MWU), defined recently by Fasoulakis et al. [AISTATS; 2022], and denoted as Forward Looking Best Response MWU (FLBR-MWU). The…

cs.GT2026

Delegated Fair Division

Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis +2

Motivated by recently introduced problems on delegated resource allocation, we study a model of fair division, where a set of indivisible goods is to be allocated to some agents, e…

cs.GT2026

Improved Approximation Guarantees for Groupwise Maximin Share Fairness

Georgios Amanatidis, Anna Korfiati, Evangelos Markakis +1

We study the problem of fairly allocating a set of indivisible goods to a set of agents with additive valuation functions. We focus on the very demanding notion of \textit{grou…

cs.GT2026

Online Fair Division Meets Reordering Buffers

Georgios Amanatidis, Giulio Giaconi, Evangelos Markakis +1

We study the online fair division of indivisible mixed manna among agents with additive valuation functions. Under the standard online model, at each time step an indivisible item…

cs.GT2026

Leveraging Matchings in Constrained Fair Division with a Conflict Graph

Evangelos Markakis, Michalis Samaris

We study the problem of allocating indivisible goods under constraints, expressed via a conflict graph . In such an instance, the items are the vertices of and connected…

cs.GT2026

Do Not Discretize, Optimize: Almost Greedy Fictitious Play

Evangelos Markakis, Christodoulos Santorinaios

Our work revolves around Fictitious Play, one of the first iterative methods that is known to converge to a Nash equilibrium in zero-sum games. In recent years, there has been a re…