In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buyer can express substitutability relationships among goods: some goods can be substituted with others at a substitution cost. Substitutability relationships allow a buyer to introduce his uncertainty as to whether it is...

This mathematics honors thesis provides an analysis of the optimality of the “Reverse Deferred Acceptance Algorithm” created by Paul Milgrom and Illya Segal for the Federal Communications Commission auction for spectrum licenses. We begin by first providing a general literature review of combinatorial auctions, including algorithmic attempts at solving such optimization problems. A description ...

There are many different ways to allocate resources in cloud computing. The economic methods are some of common ways to resource allocation. The auction-based method has some advantages compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. Resource allocation in double combinatorial auction includes two phases. Th...

Combinatorial auctions, which allow agents to bid directly for bundles of resources, are necessary for optimal auction-based solutions to resource allocation problems with agents that have non-additive values for resources, such as distributed scheduling and task assignment problems. We introduce iBundle, the first iterative combinatorial auction that is optimal for a reasonable agent bidding s...

Combinatorial auctions have important applications to resource allocation problems. These auctions allow bidders to submit bids for entire packages of goods, rather than on single items. This rich bidder interface allows bidders to specify their preferences more precisely, and as a result, allows for more efficient allocation of resources. However, these allowances to bidders come at a computat...

This paper reports the results of over 130 auctions conducted under controlled conditions to examine the robustness of several auction mechanisms to allocate multiple objects. The simultaneous discrete auction process used by the Federal Communications Commission to allocate Personal Communications licenses was contrasted with a sequential auction and a combinatorial auction over a variety of d...

This paper explores the feasibility and motivation for online combinatorial auctions. It explains combinatorial auctions and shows an innovative implementation of an iterative combinatorial auction. It then introduces online auctions and highlights some research which bounds the efficiency and revenue comparison to the standard Vickrey auction. Finally, motivations for online combinatorial auct...

Combinatorial auctions allow bidding for combinations of items (package bids) and are a useful tool when complementarities/synergies among sale objects are present. In such cases, package biding improves economic efficiency by helping bidders win packages that capture the value added due to synergies. The revenue of the seller may also increase as a result. At the same time, when synergies are ...