Memento Ludi：信息检索的博弈分析
Memento Ludi: Information Retrieval from a Game-Theoretic Perspective
摘要：
我们利用博弈论作为冲突的数学理论，建立了一个信息检索过程的宏观模型。我们将信息检索过程的参与者表示为两个抽象参与者的游戏。第一个参与者是搜索引擎用户的“知识人群”，第二个参与者是信息检索系统的社区。为了应用博弈论，我们将搜索日志数据视为纳什均衡策略，并解决了寻找合适的支付函数的逆问题。为此，我们提出了一个特定的模型，我们称之为Alpha模型。在这个模型中，我们提出了一种称为转移的方法，它可以部分控制大量用户的行为。本说明是针对博弈论（提供一类新的现实生活问题）和信息检索的研究人员，我们为他们提出了新的技术来控制IR环境。
英文摘要：
We develop a macro-model of information retrieval process using Game Theory as a mathematical theory of conflicts. We represent the participants of the Information Retrieval process as a game of two abstract players. The first player is the `intellectual crowd' of users of search engines, the second is a community of information retrieval systems. In order to apply Game Theory, we treat search log data as Nash equilibrium strategies and solve the inverse problem of finding appropriate payoff functions. For that, we suggest a particular model, which we call Alpha model. Within this model, we suggest a method, called shifting, which makes it possible to partially control the behavior of massive users. This Note is addressed to researchers in both game theory (providing a new class of real life problems) and information retrieval, for whom we present new techniques to control the IR environment.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
