Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Danaei, Alireza"'
We explore the fair distribution of a set of $m$ indivisible chores among $n$ agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two fairness criteria: envy-freeness up to any item (EFX) and a relaxed not
Externí odkaz:
http://arxiv.org/abs/2410.18655
We consider the fundamental problem of fairly allocating a set of indivisible items among agents having valuations that are represented by a multi-graph -- here, agents appear as the vertices and items as the edges between them and each vertex (agent
Externí odkaz:
http://arxiv.org/abs/2410.17002
It is known since 1975 (\cite{HK75}) that maximum cardinality matchings in bipartite graphs with $n$ nodes and $m$ edges can be computed in time $O(\sqrt{n} m)$. Asymptotically faster algorithms were found in the last decade and maximum cardinality b
Externí odkaz:
http://arxiv.org/abs/2409.14849