Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions

DOI10.1111/J.1467-9574.2007.00356.XMaRDI QIDQ5422020zbMATH OpenOpenAlexFDO

Authors Reinder B. Lok, Dolores Romero Morales, Dries Vermeulen

Publication date 26 October 2007

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-9574.2007.00356.x

Mathematics Subject Classification ID

Cooperative games (91A12) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• Technical note -- Capacitated assortment optimization: hardness and approximation
• An effective VNS for the capacitated \(p\)-median problem
• Separating capacity constraints in the CVRP using tabu search
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
• Approximation algorithms for the capacitated plant allocation problem
• The capacitated K-center problem (extended abstract)
• scientific article; zbMATH DE number 2119748
• On a modification of the VCG mechanism and its optimality
• Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
• Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem

Cites work

• Behavior in Multi-Unit Demand Auctions: Experiments with Uniform Price and Dynamic Vickrey Auctions
• Incentives in Teams
• The package assignment model.

Cited in

(2)

• A mechanism for package allocation problems with gross substitutes
• On the expressiveness of assignment messages

This page was built for publication: Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions

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