arXiv Open Access 2011

Finding maxmin allocations in cooperative and competitive fair division

Marco Dall'Aglio Camilla Di Luca

Lihat Sumber

Abstrak

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.

Topik & Kata Kunci

math.OC cs.GT math.PR

Penulis (2)

Marco Dall'Aglio

Camilla Di Luca

Format Sitasi

APA MLA BibTeX

Dall'Aglio, M., Luca, C.D. (2011). Finding maxmin allocations in cooperative and competitive fair division. https://arxiv.org/abs/1110.4241

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓