Combinatorial auctions

  title={Combinatorial auctions},
  author={Jawad Abrache and Teodor Gabriel Crainic and Michel Gendreau and Monia Rekik},
  journal={Annals of Operations Research},
Abstract Combinatorial auctions are an important class of market mechanisms in which participants are allowed to bid on bundles of multiple heterogeneous items. In this paper, we discuss several complex issues that are encountered in the design of combinatorial auctions. These issues are related to the formulation of the winner determination problem, the expression of combined bids, the design of progressive combinatorial auctions that require less information revelation, and the need for… 
Competing Against Oneself in Sealed-Bid Combinatorial Auctions
Combinatorial auctions are auctions of multiple heterogeneous objects that allow bids on subsets of the objects, giving bidders the flexibility to express if the objects in a set are more valuable
An Introduction to Iterative Combinatorial Auctions
Combinatorial auctions let bidders to express their preferences on bundles of items and are necessary for optimal allocation of goods. Direct revelation of bidders’s valuation on all combination of
Simplified Bidding and Solution Mechanisms for VCG Combinatorial Auctions
Combinatorial auctions are very useful in theory, but their applicability in practice has been limited by the need for bidders to bid on an exponential number of bundles and for the auctioneer to
Equilibria of Greedy Combinatorial Auctions
It is shown, for a variety of equilibrium concepts, including Bayes--Nash equilibria, low-regret bidding sequences, and asynchronous best-response dynamics, that the resulting price of anarchy bound is close to the approximation factor of the underlying greedy algorithm.
Informational limitations of ascending combinatorial auctions
Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts
Combinatorial procurement auctions enable suppliers to pass their potential cost synergies on to the procuring entity and may therefore lead to lower costs and enhance efficiency. However, bidders
1 Dynamic Auctions in Procurement
We study the theory and practical implementation of dynamic procurement auctions. We consider the procurement of many related items. With many related items, price discovery is important not only to
Economic and computationally efficient algorithms for bidding in a distributed combinatorial auction
Experimental results indicate that the approximate algorithms are a realistic tool for the development of large-scale distributed combinatorial auctions, and the outcome of a game theoretical analysis indicates that they are dominant strategies over the myopicoptimal ones.
On the computational power of iterative auctions
A large number of results are proved showing the boundaries of what can be achieved by auctions of this kind, first on auctions that use a polynomial number of demand queries, and then on different kinds of ascending-price auctions.
An Adaptive Bidding Strategy for Combinatorial Auction-Based Resource Allocation in Dynamic Markets
A new adaptive bidding strategy is proposed for combinatorial auction-based resource allocation problem in dynamic markets that can adjust his profit margin constantly according to his bidding history, thus perceiving and responding to the dynamic market in a timely manner.


Design issues for combinatorial auctions
This paper discusses several complex issues related to the formulation of the winner determination problem, the expression of combined bids, the design of progressive combinatorial auctions that require less information revelation, and the need for decision support tools to help participants make profitable bidding decisions.
Combinatorial auction design
This article describes a type of combinatorial auction that, during laboratory testing, eliminated problems and produced extremely efficient outcomes.
An efficient approximate algorithm for winner determination in combinatorial auctions
Auction studies on combinatorial auctions simultaneously sell multiple items with interdependent values and allow the bidders to bid on any combination of items to increase the buyers’ utilities and the seller’s revenue.
Pricing combinatorial auctions
Iterative Combinatorial Auctions: Theory and Practice
iBundle is introduced, the first iterative combinatorial auction that is optimal for a reasonable agent bidding strategy, in this case myopic best-response bidding, and its optimality is proved with a novel connection to primal-dual optimization theory.
Combinatorial Auctions: A Survey
The state of knowledge about the design of combinatorial auctions is surveyed and some new insights are presented.
Integer programming for combinatorial auction winner determination
This paper compares recent algorithms for winner determination to traditional algorithms, and presents and benchmark a mixed integer programming approach to the problem, which enables very general auctions to be treated efficiently by standard integer programming algorithms.
Bidding Languages for Combinatorial Auctions
A new, generalized language where bids are given by propositional formulae whose subformulae can be annotated with prices is introduced, which allows bidder utilities to be formulated more naturally and concisely than existing languages.
A Combinatorial Auction with Multiple Winners for Universal Service
We describe a discrete-time auction procedure called PAUSE (Progressive Adaptive User Selection Environment) for use in assigning COLR (Carrier of Last Resort) responsibility for universal service.
Optimal Auction Design
Optimal auctions are derived for a wide class of auction design problems when the seller has imperfect information about how much the buyers might be willing to pay for the object.