Calendar

May 27

13th Intl. Conf. on New Interfaces for Musical Expression

May 28

Graphics Interface 2013

May 29

Boston UXPA Usability and UX Conf. 2013

May 25

“ Civilization advances by extending the number of important operations which we can perform without thinking of them. ”

-- Alfred North Whitehead

Share this quote on...
Get more quotes via RSS or by joining our Usability Quote of the Day Facebook Page

Featured chapter

Read the fascinating history of Wearable Computing, told by its father, Steve Mann

Read Steve's chapter !

Help us help you!

Spread the word:
Donate
Other ways to help

Yunhong Zhou

Add description

← Button will not work: You have not enabled Javascript. How do I enable it?

Rename / change spelling

Add publication

← Button will not work: You have not enabled Javascript. How do I enable it?

Publications by Yunhong Zhou (bibliography)

2008

Edit | Del

Zhou, Yunhong and Naroditskiy, Victor (2008): Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding. In: Proceedings of the 2008 International Conference on the World Wide Web 2008. pp. 1175-1176.

“We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the corresponding bidding optimization problem. Our algorithm selects items online based on a threshold function which can be built/updated using historical data. Our algorithm achieved about 99% performance compared to the offline optimum when applied to a real bidding dataset. With synthetic dataset and iid item-sets, its performance ratio against the offline optimum converges to one empirically with increasing number of periods.”

Edit | Del

Zhou, Yunhong, Chakrabarty, Deeparnab and Lukose, Rajan (2008): Budget constrained bidding in keyword auctions and online knapsack problems. In: Proceedings of the 2008 International Conference on the World Wide Web 2008. pp. 1243-1244.

“We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both deterministic and randomized algorithms for the online (multiple-choice) knapsack problems achieving a provably optimal competitive ratio. This translates back to fully automatic bidding strategies maximizing either profit or revenue for the budget-constrained advertiser. Our bidding strategy for revenue maximization is oblivious (i.e., without knowledge) of other bidders' prices and/or click-through-rates for those positions. We evaluate our bidding algorithms using both synthetic data and real bidding data gathered manually, and also discuss a sniping heuristic that strictly improves bidding performance. With sniping and parameter tuning enabled, our bidding algorithms can achieve a performance ratio above 90% against the optimum by the omniscient bidder.”

2007

Edit | Del

Zhou, Yunhong and Lukose, Rajan M. (2007): Vindictive bidding in keyword auctions. In: Gini, Maria L., Kauffman, Robert J., Sarppo, Donna, Dellarocas, Chrysanthos and Dignum, Frank (eds.) Proceedings of the 9th International Conference on Electronic Commerce - ICEC 2007 August 19-22, 2007, Minneapolis, MN, USA. pp. 141-146.

Add publication