Sciweavers

199 search results - page 34 / 40
» Auctions with Untrustworthy Bidders
Sort
View
CCGRID
2009
IEEE
15 years 7 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
GLOBECOM
2009
IEEE
16 years 1 months ago
An Auction-Based Incentive Mechanism for Non-Altruistic Cooperative ARQ via Spectrum-Leasing
— We propose and analyze a novel decentralized mechanism that motivates otherwise non-cooperative stations to participate as relays in cooperative ARQ protocol. Cooperation incen...
Igor Stanojev, Osvaldo Simeone, Umberto Spagnolini...
WINE
2007
Springer
132views Economy» more  WINE 2007»
16 years 23 days ago
Adwords Auctions with Decreasing Valuation Bids
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
Gagan Goel, Aranyak Mehta
CP
2003
Springer
15 years 12 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano
IJCAI
2001
15 years 8 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...