Budget feasible mechanisms on matroids
From MaRDI portal
Publication:5920068
DOI10.1007/978-3-319-59250-3_30zbMath1422.91312arXiv1612.03150OpenAlexW2563445721MaRDI QIDQ5920068
Qiang Zhang, Gianpiero Monaco, Piotr Sankowski, Stefano Leonardi
Publication date: 31 August 2017
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.03150
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (3)
Budget feasible mechanisms for procurement auctions with divisible agents ⋮ Budget feasible mechanisms on matroids ⋮ Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online
This page was built for publication: Budget feasible mechanisms on matroids