Find it if you can: a game for modeling different types of web search success using interaction data

Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agichtein. Find it if you can: a game for modeling different types of web search success using interaction data. In Wei-Ying Ma, Jian-Yun Nie, Ricardo A. Baeza-Yates, Tat-Seng Chua, W. Bruce Croft, editors, Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2011, Beijing, China, July 25-29, 2011. pages 345-354, ACM, 2011. [doi]

@inproceedings{AgeevGLA11,
  title = {Find it if you can: a game for modeling different types of web search success using interaction data},
  author = {Mikhail Ageev and Qi Guo and Dmitry Lagun and Eugene Agichtein},
  year = {2011},
  doi = {10.1145/2009916.2009965},
  url = {http://doi.acm.org/10.1145/2009916.2009965},
  tags = {modeling, search},
  researchr = {https://researchr.org/publication/AgeevGLA11},
  cites = {0},
  citedby = {0},
  pages = {345-354},
  booktitle = {Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2011, Beijing, China, July 25-29, 2011},
  editor = {Wei-Ying Ma and Jian-Yun Nie and Ricardo A. Baeza-Yates and Tat-Seng Chua and W. Bruce Croft},
  publisher = {ACM},
  isbn = {978-1-4503-0757-4},
}