34 search results - page 5 / 7 » Online auctions and generalized secretary problems |
ESA
2007
Springer
14 years 5 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
In a dynamic market, being able to update one’s value based on information available to other bidders currently in the market can be critical to having profitable transactions. ...
AAAI
2008
14 years 1 months ago
2008
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
SIGECOM
2005
ACM
14 years 4 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...