549 search results - page 57 / 110 » Computational Bundling for Auctions |
ICCAD
2010
IEEE
13 years 7 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
WWW
2009
ACM
14 years 10 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
SIGECOM
2005
ACM
14 years 3 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...
SIGECOM
2004
ACM
14 years 3 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
SIGECOM
2004
ACM
14 years 3 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...