Combinatorial auctions

By Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau, Monia Rekik. Annals of Operations Research, 2007

727 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Management Science and Operations Research, Marketing

View Paper: https://www.semanticscholar.org/paper/8000ad14f9d8805ec45740683a40f4d9bdfead6f

How researchers see this paper

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

Citations in the corpus

A survey on service function chaining (2016, unknown): “The authors demonstrate that auction based approaches [47] does not necessarily result in the most efficient solution.”
Discrete convex analysis: A tool for economics and game theory (2016, unknown): “, Gul & Stacchetti (2000), Milgrom (2004), Cramton et al. (2006), and Blumrosen & Nisan (2007) for comprehensive accounts.”
Game theory for cognitive radio networks: An overview (2010, unknown): “This is known as the combinatorial auction [51].”
Complementary Bidding Mechanisms and Startup Costs in Electricity Markets (2014, unknown): “See Cramton et al. (2006) for a comprehensive treatment of tools and applications.”
A review on algorithms for maximum clique problems (2015, unknown): “…clustering (Schaeﬀer, 2007), graph vertex coloring (Chams, Hertz, & Werra, 1987; Wu & Hao, 2012a), max-min diversity (Croce, Grosso, & Lo-catelli, 2009), optimal winner determination (Shoham, Cramton, & Steinberg, 2006), set packing (Wu, Hao, & Glover, 2012) and sum coloring (Wu & Hao, 2012b).”
Electricity Auctions: An Overview of Efficient Practices (2011, background): “This price elasticity follows the experience of the US capacity auctions in ISO-NE and PJM. 18 For a thorough discussion of combinatorial auctions, see Cramton et al. (2006).”
Intelligent Freight Transportation Systems : Assessment and the Contribution of Operations Research (2009, unknown): “According to the best knowledge of the authors, Crainic et al. (2007) is the only contribution targeting these issues.”
Truthful approximation mechanisms for restricted combinatorial auctions (2008, unknown): “Such combinatorial auctions have been suggested for a host of auction situations such as those for spectrum licenses, pollution permits, landing slots, computational resources, online procurement and others.”
Adapting auctions for the provision of ecosystem services at the landscape scale (2011, unknown): “A number of solutions to this problem have been developed for combinatorial auctions (see Cramton et al., 2006).”
School choice with controlled choice constraints: Hard bounds versus soft bounds (2011, unknown): “16 We now show that there exists a feasible assignment that is both fair for same types and constrained non-wasteful in a controlled school choice problem.”
Issues in Multiagent Resource Allocation (2006, unknown): “However, there are still enormous challenges confronting users who want to get the maximum value out of e -sourcing.”