"Envy-free cake cutting: A polynomial number of queries with high probability."

Guillaume Chèze (2020)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2020-05-08

a service of  Schloss Dagstuhl - Leibniz Center for Informatics