At the end of the 1990s online reverse auctions were proposed as a powerful tool to improve the performance of corporate procurement. However, as many of the promises of the e-Business world failed to materialize the issue received only little attention during the last years. Hence, it is not known what kind of role reverse auctions play and what kind of auction designs are used in practice. Fo...

In a previous work we extended the notion of multi-unit combinatorial reverse auction (MUCRA) by adding a new dimension to the goods at auction. A buyer can express transformability relationships among goods: some goods can be transformed into others at a transformation cost. Through this new auction type, a buyer can find out what goods to buy, to whom, and what transformations to apply to the...

We carry optimization of the cellular network and a device-to-device (D2D) underlay communication by optimizing spectral sharing through auction-based mechanism. For that, we implement reverse iterative combinatorial auction mechanism(R-ICA), in which the cellular devices laced with spectral bandwidth bid for d2d devices iteratively. We introduce a slight conjunction, and use sum rate as a prio...

This paper presents a novel incentive-based load shedding management scheme within microgrid environment equipped with the required IoT infrastructure. The proposed mechanism works on principles of reverse combinatorial auction. We consider region multiple consumers who are willing to curtail their in peak hours order gain some incentives later. Using properties auctions, participants can bid p...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

In combinatorial auctions, buyers and sellers bid not only for single items but also for combinations (or “bundles,” or “baskets”) of items. Clearing the auction is in general an NP-hard problem; it is usually solved with integer linear programming. We proposed in an earlier paper a continuous approximation of this problem, where orders are aggregated and integrality constraints are relaxed. It...

In a disaster environment no single agent knows the disaster situation completely. So, rescue agents share their information in order to identify rescue tasks that are then allocated. In this paper we model the allocation problem as a reverse combinatorial auction and we apply some existing algorithms to solve it. Our results have been compared with the RoboCup classification of 2005.

Combinatorial auctions have recently attracted the interests of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a combinatorial auction, multiple items with interdependent values are sold simultaneously and bidders are allowed to bid on any combination of items. This paper presents a method for implementing several secure combinato...

Cloud service providers typically provide different types of virtual machines (VMs) to cloud users with various requirements. Thanks its effectiveness and fairness, auction has been widely applied in this heterogeneous resource allocation. Recently, several strategy-proof combinatorial auction ...