3433 search results - page 258 / 687 » Heuristics for a bidding problem |
181
click to vote
PERCOM
2009
ACM
16 years 1 months ago
2009
ACM
—This paper addresses the problem of providing congestion-management for a shared wireless sensor networkbased target tracking system. In many large-scale wireless sensor network...
163
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
173
click to vote
WINE
2007
Springer
16 years 24 days ago
2007
Springer
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
176
click to vote
AMEC
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
187
Voted
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...