Combinatorial Auctions: A Survey

By Sven de Vries, Rakesh V. Vohra. INFORMS journal on computing, 2003

1,184 citations recorded by the source corpus.

Subfields: Automotive Engineering, Management Science and Operations Research, Marketing

View Paper: https://www.semanticscholar.org/paper/593643fd94f5fb535c7c6e37d0b1cb2dbece740f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Management Science and Operations Research

In Marketing

Citations in the corpus

Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective (2003, background): “In addition to transportation service procurement, combinatorial auctions have been applied to the allocation of other assets in which such complementarities and substitution effects exist ( 2 ).”
Horizontal cooperation among freight carriers: request allocation and profit sharing (2008, methodology): “The mechanism of combinatorial auction, called matrix auction is proposed for bundles of requests (de Vries and Vohra, 2003).”
Combinatorial auctions (2007, neutral): “Model (M1) corresponds to a set-packing problem (de Vries and Vohra 2003). The classical account of the problem by Rothkopf et al. (1998) first proposes a dynamic programming algorithm that can determine a revenue-maximizing allocation in O(3) iterations.”
Solutions to the request reassignment problem in collaborative carrier networks (2010, methodology): “The economic efficiency of exchange markets can be significantly enhanced through bundled bids (de Vries and Vohra, 2003).”
A Survey on Big Data Market: Pricing, Trading and Protection (2018, background): “As a result, the combinatorial auction [129], [130] was designed for such a situation.”
A General Framework for Wireless Spectrum Auctions (2007, background): “a painting), single-item in multi-unit bundles [9], [23] and multi-item, multi-unit bundles [8] (e.”
Combinatorial auction design (2003, background): “The survey by de Vries and Vohra (2003) addresses the huge literature of the last few years on algorithmic approaches.”
Consensus-Based Decentralized Auctions for Robust Task Allocation (2009, methodology): “To address this dependency, previous combinatorial auction methods [42]–[45] treated each assignment combination (bundle) as a single item for bidding that led to complicated winner selection methods.”
Managing Online Auctions: Current Business and Research Issues (2003, background): “Comparisons like the one done in Dewan and Hsu (2001) between two settings in which the reputation differences are substantial will probably be more informative.”
Intelligent Freight Transportation Systems : Assessment and the Contribution of Operations Research (2009, background): “…other hand, combinatorial auctions require more complex operations research mechanisms to determine load allocations and the corresponding prices (Abrache et al., 2004, 2007; de Vries and Vohra, 2003; Park and Rothkopf, 2005; Rothkopf et al., 1988; Rothkopf and Park, 2001; Figliozzi et al., 2005).”
Combinatorial Auction-Based Allocation of Virtual Machine Instances in Clouds (2010, background): “There are n users u1, . . . , un, each requesting a set of VM instances and revealing how much she values that particular set.”
The Algorithm Design Manual (2020, methodology): “Bidding strategies for combinatorial auctions typically reduce to solving set-packing problems, as described in [dVV03].”
Truthful approximation mechanisms for restricted combinatorial auctions (2008, background): “Much work has recently been done on these topics, see e.g., (Vohra & de Vries 2000; Sandholm et al. 2001; Nisan 2000; Lehmann, O’Callaghan, & Shoham 1999) and many references therein.”