An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Neogi, Rian, Pashkovich, Kanstantsin, Swamy, Chaitanya
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms F.2.2; G.2; J.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2506.04665