### 8 papers:

- ICALP-v1-2014-HajiaghayiLP #algorithm #online #problem
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.
- CASE-2013-HoC #contest #design #game studies
- Stackelberg game formulation of prize competition design for seeking shortest path solutions (TYH, SCC), pp. 374–379.
- CSCW-2013-JoycePB #collaboration
- Keeping eyes on the prize: officially sanctioned rule breaking in mass collaboration systems (EJ, JP, BSB), pp. 1081–1092.
- SIGIR-2012-TanGS #exclamation #identification
- $100, 000 prize jackpot. call now!: identifying the pertinent features of SMS spam (HT, NG, MS), pp. 1175–1176.
- KDD-2009-McSherryM #privacy #recommendation
- Differentially Private Recommender Systems: Building Privacy into the Netflix Prize Contenders (FM, IM), pp. 627–636.
- RecSys-2008-TakacsPNT #algorithm #matrix #problem
- Matrix factorization and neighbor based algorithms for the netflix prize problem (GT, IP, BN, DT), pp. 267–274.
- KDD-2006-Piatetsky-ShapiroGDFGZ #challenge #data mining #mining #question
- Is there a grand challenge or X-prize for data mining? (GPS, RG, CD, RF, LG, MJZ), pp. 954–956.
- STOC-1995-AwerbuchABV #approximate
- Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (BA, YA, AB, SV), pp. 277–283.