Upcoming Courses

go to course
UI Design Patterns for Successful Software
Starts the day after tomorrow !
go to course
Affordances: Designing Intuitive User Interfaces
92% booked. Starts in 3 days
 
 

Featured chapter

Marc Hassenzahl explains the fascinating concept of User Experience and Experience Design. Commentaries by Don Norman, Eric Reiss, Mark Blythe, and Whitney Hess

User Experience and Experience Design !

 
 

Our Latest Books

 
 
The Social Design of Technical Systems: Building technologies for communities. 2nd Edition
by Brian Whitworth and Adnan Ahmad
start reading
 
 
 
 
Gamification at Work: Designing Engaging Business Software
by Janaki Mythily Kumar and Mario Herger
start reading
 
 
 
 
The Social Design of Technical Systems: Building technologies for communities
by Brian Whitworth and Adnan Ahmad
start reading
 
 
 
 
The Encyclopedia of Human-Computer Interaction, 2nd Ed.
by Mads Soegaard and Rikke Friis Dam
start reading
 
 

Yunhong Zhou

 

Publications by Yunhong Zhou (bibliography)

 what's this?
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. Available online

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.

© All rights reserved Zhou and Naroditskiy and/or ACM Press

 
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. Available online

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.

© All rights reserved Zhou et al. and/or ACM Press

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. Available online

 
Add publication
Show list on your website
 
 

Join our community and advance:

Your
Skills

Your
Network

Your
Career

 
Join our community!
 
 
 

Page Information

Page maintainer: The Editorial Team
URL: http://www.interaction-design.org/references/authors/yunhong_zhou.html