Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"indivisible goods"”.
-
Algorithms for fair division through competitive equilibrium
… algorithms for computing CE of mixed manna (goods and bads), and applications to the fair division of indivisible goods. First, I examine the problem of allocating a mixed manna under additively separable piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone …
-
Algorithms and complexity results for problems on fair division and imitation games
"We study the problem of allocating indivisible goods to agents in a fair and efficient manner. We consider different notions of fairness such as envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) in conjuction with Pareto-optimality (PO). We present polynomial time …