review-article

Free access

Rethinking search engines and recommendation systems: a game theoretic perspective

Authors:

Moshe Tennenholtz,

Oren KurlandAuthors Info & Claims

Communications of the ACM, Volume 62, Issue 12

Pages 66 - 75

https://doi.org/10.1145/3340922

Published: 21 November 2019 Publication History

All formats PDF

Abstract

Novel approaches draw on the strength of game theoretic mechanism design.

References

[1]

Bahar, G., Smorodinsky, R., and Tennenholtz, M. Economic recommendation systems: One page abstract. In Proceedings of EC, 2016, 757--757.

Google Scholar

[2]

Ben-Basat, R., Tennenholtz, M., and Kurland, O. The probability ranking principle is not optimal in adversarial retrieval settings. In Proceedings of ICTIR, 2015, 51--60.

Google Scholar

[3]

Ben-Basat, R., Tennenholtz, M., and Kurland, O. A game theoretic analysis of the adversarial retrieval setting. J. Artif Intell. Res. 60 (2017), 1127--1164.

Crossref

Google Scholar

[4]

Ben-Porat, O. and Tennenholtz, M. Best response regression. In Proceedings of NIPS, 2017, 1498--1507.

Google Scholar

[5]

Ben-Porat, O. and Tennenholtz, M. A Game-theoretic approach to recommendation systems with strategic content providers. In Proceedings of NeurIPS, 2018, 1118--1128.

Google Scholar

[6]

Bendersky, M., Croft, W.B., and Diao, Y. Quality-biased ranking of Web documents. In Proceedings of WSDM, 2011, 95--104.

Google Scholar

[7]

Biega, A.J., Gummadi, K.P., and Weikum, G. Equity of attention: Amortizing individual fairness in rankings. In Proceedings of SIGIR, 2018, 405--414.

Google Scholar

[8]

Bubeck, S. and Cesa-Bianchi, N. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning 5, 1 (2012), 1--122

Crossref

Google Scholar

[9]

Che, Y.K. and Horner, J.O. Optimal Design for Social Learning. Cowles Foundation Discussion Paper No. 2000, 2015.

Google Scholar

[10]

Cramton, P., Shoham, Y., and Steinberg, R. An overview of combinatorial auctions. SIGecom Exchanges 7, 1 (2007), 3--14.

Digital Library

Google Scholar

[11]

Dalvi, N., Domingos, P., Mausam, Sanghai, S., and Verma, D. Adversarial classification. In Proceedings of KDD, 2004, 99--108.

Google Scholar

[12]

Frazier, P.I., Kempe, D., Kleinberg, J.M., and Kleinberg, R. Incentivizing exploration. In Proceedings of EC, 2014, 5--22.

Google Scholar

[13]

Goodfellow, I.J., Shlens, J., and Szegedy, C. Explaining and harnessing adversarial examples. In Proceedings of ICLR, 2015.

Google Scholar

[14]

Goren, G., Kurland, O., Tennenholtz, M., and Raiber, F. Ranking robustness under adversarial document manipulations. In Proceedings of SIGIR, 2018, 395--404.

Google Scholar

[15]

Gyöngyi, Z. and Garcia-Molina, H. Web spam taxonomy. In Proceedings of AIRWeb, 2005, 39--47.

Google Scholar

[16]

Immorlica, N., Kalai, A.T., Lucier, B., Moitra, A., Postlewaite, A., and Tennenholtz, M. Dueling algorithms. In Proceedings of STOC, 2011, 215--224.

Google Scholar

[17]

Izsak, P., Raiber, F., Kurland, O., and Tennenholtz, M. The search duel: A response to a strong ranker. In Proceedings of SIGIR, 2014, 919--922.

Google Scholar

[18]

Jardine, N. and van Rijsbergen, C.J. The use of hierarchic clustering in information retrieval. Information Storage and Retrieval 7, 5 (1971), 217--240.

Crossref

Google Scholar

[19]

Joachims, T., Granka, L., Pan, B., Hembrooke, H., and Gay, G. Accurately interpreting clickthrough data as implicit feedback. In Proceedings of SIGIR, 2005, 154--161.

Google Scholar

[20]

Jones, K.S., Walker, S., and Robertson, S.E. A probabilistic model of information retrieval: development and comparative experiments---Part 1. Information Processing and Management 36, 6 (2000), 779--808.

Google Scholar

[21]

Koutsoupias, E. and Papadimitriou, C. Worst-case equilibria. In Proceedings of STACS, 1999.

Crossref

Google Scholar

[22]

Kremer, I., Mansour, Y., and Perry, M. Implementing the wisdom of the crowd. J. Political Economy 122 (2014), 988--1012.

Crossref

Google Scholar

[23]

Lafferty, J. and Zhai, C. Probabilistic relevance models based on document and query generation. Language Modeling and Information Retrieval. Kluwer Academic Publishers, 2003, 1--10.

Google Scholar

[24]

Lavrenko, V. and Croft, W.B. Relevance-based language models. In Proceedings of SIGIR, 2001, 120--127.

Google Scholar

[25]

Liu, T. Learning to Rank for Information Retrieval. Springer, 2011.

Crossref

Google Scholar

[26]

Mansour, Y., Slivkins, A., and Syrgkanis, V. Bayesian incentive--compatible bandit exploration. In Proceedings of EC, 2015.

Digital Library

Google Scholar

[27]

Mansour, Y., Slivkins, A., Syrgkanis, V., and Wu, Z.S. Bayesian Exploration: Incentivizing Exploration in Bayesian Games. CoRR (2016); http://arxiv.org/abs/1602.07570

Google Scholar

[28]

Mitra, B. and Craswell, N. Neural Models for Information Retrieval. CoRR (2017); http://arxiv.org/abs/1705.01509

Google Scholar

[29]

Nisan, N., Roughgarden, T., Tardos, E., and Vazirani, V.V. Algorithmic Game Theory. Cambridge University Press, 2007.

Crossref

Google Scholar

[30]

Procaccia, A. and Tennenholtz, M. Approximate mechanism design without Money. In Proceedings of EC, 2009.

Digital Library

Google Scholar

[31]

Radinsky, K. and Bennett, P.N. Predicting content change on the Web. In Proceedings of WSDM, 2013, 415--424.

Google Scholar

[32]

Raifer, N., Raiber, F., Tennenholtz, M., and Kurland, O. Information retrieval meets game theory: The ranking competition between documents' authors. In Proceedings of SIGIR, 2017, 465--474.

Google Scholar

[33]

Robertson, S.E. The Probability Ranking Principle in IR. J. Documentation (1977), 294--304. Reprinted in Readings in Information Retrieval, K. Sparck Jones and P. Willett (eds), 1997, 281--286.

Crossref

Google Scholar

[34]

Roughgarden, T. and Tardos, E. How bad is selfish routing? JACM 49, 2 (April 2002), 236--259.

Digital Library

Google Scholar

[35]

Salton, J., Wong, A., and Yang, C.S. A vector space model for automatic indexing. Commun. ACM 18, 11 (Nov. 1975), 613--620.

Digital Library

Google Scholar

[36]

Santos, A.S.R., Pasini, B., and Freire, J. A first study on temporal dynamics of topics on the Web. In Proceedings of WWW, 2016, 849--854.

Google Scholar

[37]

Shapley, L.S. A value for n-person games. Contributions to the Theory of Games II, Harold W. Kuhn and Albert W. Tucker, (eds.). Princeton University Press, Princeton, NJ, 1953, 307--317.

Google Scholar

[38]

Varian, H.R. Online ad auctions. American Economic Review 99, 2 (2009).

Crossref

Google Scholar

[39]

Wang, L., Bennett, P.N., and Collins-Thompson, K. Robust ranking models via risk-sensitive optimization. In Proceedings of SIGIR, 2012, 761--770.

Google Scholar

[40]

Yang, G.H., Sloan, M., and Wang, J. Dynamic Information Retrieval Modeling. Morgan & Claypool Publishers, 2016.

Digital Library

Google Scholar

Cited By

View all

Cai RWu FLi ZQiao JChen WHao YGu H(2023)REST: Debiased Social Recommendation via Reconstructing Exposure StrategiesACM Transactions on Knowledge Discovery from Data10.1145/362498618:2(1-24)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3624986
Vasilisky ZKurland OTennenholtz MRaiber FYoshioka MKiseleva JAliannejadi M(2023)Content-Based Relevance Estimation in Retrieval Settings with Ranking-Incentivized Document ManipulationsProceedings of the 2023 ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3578337.3605124(205-214)Online publication date: 9-Aug-2023
https://dl.acm.org/doi/10.1145/3578337.3605124
Ben-Porat OTorkan R(2023)Learning with Exposure Constraints in Recommendation SystemsProceedings of the ACM Web Conference 202310.1145/3543507.3583320(3456-3466)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543507.3583320
Show More Cited By

Index Terms

Rethinking search engines and recommendation systems: a game theoretic perspective
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Multi-agent systems
2. Information systems
  1. Information systems applications

Recommendations

Overlap Among Major Web Search Engines
ITNG '06: Proceedings of the Third International Conference on Information Technology: New Generations

Our study examined the overlap among results retrieved by three major Web search engines for a large set of more than 10,316 queries. Previous smaller studies have discussed the lack of overlap in results returned by Web search engines for the same ...
Recommendation Applications and Systems at Electronic Arts
RecSys '17: Proceedings of the Eleventh ACM Conference on Recommender Systems

The digital game industry has recently adopted recommendation systems to provide suitable game and content choices to players. Recommendations in digital games have several unique applications and challenges compared to other well known recommendation ...
A study of results overlap and uniqueness among major web search engines

The performance and capabilities of Web search engines is an important and significant area of research. Millions of people world wide use Web search engines very day. This paper reports the results of a major study examining the overlap among results ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 62, Issue 12

December 2019

78 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3372896

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 November 2019

Published in CACM Volume 62, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Review-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
4,325
Total Downloads

Downloads (Last 12 months)278
Downloads (Last 6 weeks)11

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cai RWu FLi ZQiao JChen WHao YGu H(2023)REST: Debiased Social Recommendation via Reconstructing Exposure StrategiesACM Transactions on Knowledge Discovery from Data10.1145/362498618:2(1-24)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3624986
Vasilisky ZKurland OTennenholtz MRaiber FYoshioka MKiseleva JAliannejadi M(2023)Content-Based Relevance Estimation in Retrieval Settings with Ranking-Incentivized Document ManipulationsProceedings of the 2023 ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3578337.3605124(205-214)Online publication date: 9-Aug-2023
https://dl.acm.org/doi/10.1145/3578337.3605124
Ben-Porat OTorkan R(2023)Learning with Exposure Constraints in Recommendation SystemsProceedings of the ACM Web Conference 202310.1145/3543507.3583320(3456-3466)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543507.3583320
Kolumbus YNisan NKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)How and why to manipulate your own agentProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602306(28080-28094)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602306
Patro GPorcaro LMitchell LZhang QZehlike MGarg N(2022)Fair ranking: a critical review, challenges, and future directionsProceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency10.1145/3531146.3533238(1929-1942)Online publication date: 21-Jun-2022
https://dl.acm.org/doi/10.1145/3531146.3533238
Soltaniyeh MLagrange Moutinho Dos Reis VBryson MYao XMartin RNagarakatte SFeng DBecker SHerbst NLeitner PPapadopoulos A(2022)Near-Storage Processing for Solid State Drive Based Recommendation Inference with SmartSSDs®Proceedings of the 2022 ACM/SPEC on International Conference on Performance Engineering10.1145/3489525.3511672(177-186)Online publication date: 9-Apr-2022
https://dl.acm.org/doi/10.1145/3489525.3511672
Kolumbus YNisan N(2022)Auctions between Regret-Minimizing AgentsProceedings of the ACM Web Conference 202210.1145/3485447.3512055(100-111)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3485447.3512055
Kurland OTennenholtz MAmigo ECastells PGonzalo JCarterette BCulpepper JKazai G(2022)Competitive SearchProceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3477495.3532771(2838-2849)Online publication date: 6-Jul-2022
https://dl.acm.org/doi/10.1145/3477495.3532771
Lin ZFeng LArdestani ELee JLundell JKim CKejariwal AOwens J(2022)Building a Performance Model for Deep Learning Recommendation Model Training on GPUs2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)10.1109/ISPASS55109.2022.00030(227-229)Online publication date: May-2022
https://doi.org/10.1109/ISPASS55109.2022.00030
Lin ZFeng LArdestani ELee JLundell JKim CKejariwal AOwens J(2022)Building a Performance Model for Deep Learning Recommendation Model Training on GPUs2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC)10.1109/HiPC56025.2022.00019(48-58)Online publication date: Dec-2022
https://doi.org/10.1109/HiPC56025.2022.00019
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Overlap Among Major Web Search Engines

Recommendation Applications and Systems at Electronic Arts

A study of results overlap and uniqueness among major web search engines

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations