Combinatorial auction design.

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

An Agent Based Market Design Methodology for Combinatorial Auctions

Auction mechanisms have attracted a great deal of interest and have been used in diverse emarketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions. Therefore, diverse combinatorial auction market types have been proposed to satisfy market needs. These combinatorial auction types have diverse market characteristics, which require...

Sample Complexity of Automated Mechanism Design

The design of revenue-maximizing combinatorial auctions, i.e. multi-item auctions over bundles of goods, is one of the most fundamental problems in computational economics, unsolved even for two bidders and two items for sale. In the traditional economic models, it is assumed that the bidders’ valuations are drawn from an underlying distribution and that the auction designer has perfect knowled...

Making the FCC's First Combinatorial Auction Work Well Comment on DA 00-1075, “COMMENT SOUGHT ON MODIFYING THE SIMULTANEOUS MULTIPLE ROUND AUCTION DESIGN TO ALLOW COMBINATORIAL

Lecture 10 4 Combinatorial Auctions 4.1 Vickrey Auction

In this section, we present a few examples from the area of mechanism design. The fundamental questions that one attempts to address in mechanism design is the following: Assuming that players act strategically, how should we design the rules of the game such that the players’ strategic behavior leads to a certain desirable outcome of the game? As a motivating example, we first consider one of ...

Chapter 16 . Non - computational Approaches to Mitigating Computational Problems in Combinatorial

16.1 Introduction Hikers encountering a fallen tree blocking a trail can climb over it, cut a path through it, or walk around it. In general, obstacles can be overcome, reduced, or avoided. Often, reducing the obstacle or avoiding it is a preferable choice. The computational problems in combinatorial auctions are no different. The previous four chapters have been largely devoted to describing w...