163 search results - page 14 / 33 » Approximate bidding algorithms for a distributed combinatori... |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we analyse how traders select marketplaces and bid in a setting with multiple competing marketplaces. Specifically, we use a fictitious play algorithm to analyse the...
WINE
2005
Springer
14 years 25 days ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...