Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gao, Ruiquan, Roghani, Mohammad, Rubinstein, Aviad, Saberi, Amin
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2409.15713