Searching for "Budget constrained bidding in keyword auctions and online knapsack problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Budget constrained bidding in keyword auctions and online knapsack problems
by Yunhong Zhou — 2007 — In WWW2007 Workshop on Sponsored Search Auctions
…Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems Yunhong Zhou HP Labs…
Cited by 2 (0 self) – Add To MetaCart

Deeparnab Chakrabarty “An Alternate Proof of Nash-Williams-Tutte Theorem via Max-min Spanning Trees ” Submitted to Journal. Conference Publications
by Deeparnab Chakrabarty, Adviser Prof, Vijay V. Vazirani, Deeparnab Chakrabarty, Nikhil Devanur
…-Cooperative Games”. ICGT, Stony Brook, July 2007. “Budget Constrained Bidding in Keyword Auctions and Online…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB