Sciweavers

163 search results - page 15 / 33
» Approximate bidding algorithms for a distributed combinatori...
Sort
View
CCGRID
2009
IEEE
13 years 8 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
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
ESA
2003
Springer
100views Algorithms» more  ESA 2003»
14 years 18 days ago
Multi-player and Multi-round Auctions with Severely Bounded Communication
We study auctions in which bidders have severe constraints on the size of messages they are allowed to send to the auctioneer. In such auctions, each bidder has a set of k possible...
Liad Blumrosen, Noam Nisan, Ilya Segal
MONET
2006
107views more  MONET 2006»
13 years 7 months ago
Auction-Based Spectrum Sharing
We study auction mechanisms for sharing spectrum among a group of users, subject to a constraint on the interference temperature at a measurement point. The users access the channe...
Jianwei Huang, Randall Berry, Michael L. Honig
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
14 years 1 months ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden