Online group-buying is one of the most innovative business models employed by many companies. From the perspective of buyers, quantity based discounts provide a huge incentive to form coalitions and take advantage of lower prices without ordering more than their actual demand. Traditional group-buying mechanisms are usually based on a single item and uniform cost sharing. One way to reduce the ...

Although combinatorial reverse auction has attracted much attention recently, most studies focus on problems with single buyer and multiple sellers. In this paper, we will study combinatorial reverse auction with multiple buyers and multiple sellers. We propose the concept of proxy buyer to deal with this problem. The proxy buyer consolidates the demands from the buyers and then holds a reverse...

Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and ...

Fu-Shiung Hsieh # Department of Computer Science and Information Engineering, Chaoyang University of Technology Taiwan, R.O.C. [email protected] Abstract—We formulate group buying problem as a combinatorial reverse auction problem with multiple buyers and multiple sellers. We propose the concept of proxy buyer to deal with this problem. The proxy buyer consolidates the demands from the buyers...

Reverse Combinatorial auctions, that is, auctions where bidders can bid on the supply right of combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. A common model is formulated for optimal the winner determination problem of reverse combinatorial auction. A PRIM (P...

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...

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 transformability relationships among goods: some goods can be transformed into others at a transformation cost. Transformability relationships allow a buyer to introduce his information as to whether it ...

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...