Mechanisms for Hiring a Matroid Base without Money

DOI10.1007/978-3-662-44803-8_22MaRDI QIDQ2938663zbMATH OpenOpenAlexFDO

Authors E. Pountourakis, Guido Schäfer

Publication date 14 January 2015

Published in Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/22953

zbMATH Keywords

matroid base hiringminimum total costpolynomial-time randomized mechanism

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Budget feasible mechanisms on matroids
• Budget feasible mechanisms on matroids
• Matroids, secretary problems, and online mechanisms
• An ascending Vickrey auction for selling bases of a matroid
• Matroid prophet inequalities and applications to multi-dimensional mechanism design
• On the generality of the greedy algorithm for solving matroid base problems
• scientific article; zbMATH DE number 140090
• Multi-parameter mechanism design under budget and matroid constraints

This page was built for publication: Mechanisms for Hiring a Matroid Base without Money

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938663)