6 research outputs found
Efficient Three-stage Auction Schemes for Cloudlets Deployment in Wireless Access Network
Cloudlet deployment and resource allocation for mobile users (MUs) have been
extensively studied in existing works for computation resource scarcity.
However, most of them failed to jointly consider the two techniques together,
and the selfishness of cloudlet and access point (AP) are ignored. Inspired by
the group-buying mechanism, this paper proposes three-stage auction schemes by
combining cloudlet placement and resource assignment, to improve the social
welfare subject to the economic properties. We first divide all MUs into some
small groups according to the associated APs. Then the MUs in same group can
trade with cloudlets in a group-buying way through the APs. Finally, the MUs
pay for the cloudlets if they are the winners in the auction scheme. We prove
that our auction schemes can work in polynomial time. We also provide the
proofs for economic properties in theory. For the purpose of performance
comparison, we compare the proposed schemes with HAF, which is a centralized
cloudlet placement scheme without auction. Numerical results confirm the
correctness and efficiency of the proposed schemes.Comment: 22 pages,12 figures, Accepted by Wireless Network
Competitive Auctions for Multiple Digital Goods
Competitive auctions encourage consumers to bid their utility values while achieving revenue close to that of xed pricing with perfect market analysis. These auctions were introduced in [6] in the context of selling an unlimited number of copies of a single item (e.g., rights to watch a movie broadcast). In this paper we study the case of multiple items (e.g., concurrent broadcast of several movies). We show auctions that are competitive for this case. The underlying auction mechanisms are more sophisticated than in the single item case, and require solving an interesting optimization problem. Our results are based on a sampling problem that may have other applications