Theoretical game analysis of position auctions according to the Vickrey–Clarke–Groves mechanism with two-stage ranking
- 作者: Blinov N.G.1
-
隶属关系:
- Faculty of Computational Mathematics and Cybernetics
- 期: 卷 40, 编号 4 (2016)
- 页面: 165-170
- 栏目: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176152
- DOI: https://doi.org/10.3103/S0278641916040026
- ID: 176152
如何引用文章
详细
Different types of position auctions are considered. A position auction is a mechanism for the allocation of advertising space in search engine results to a user-defined query. Advertisers make bids they are willing to pay the search engine for a click to their website. The search engine determines whose advertisements will get to the page and in what position, based on the bids of all the advertisers. Different types of such auctions are discussed using the example of the Yandex search engine based on the Vickrey–Clarke–Grovesmechanism. The main result is a formalization of the concept of an auction with two-stage ranking and its balance test.
作者简介
N. Blinov
Faculty of Computational Mathematics and Cybernetics
编辑信件的主要联系方式.
Email: nikita.blinov@gmail.com
俄罗斯联邦, Moscow, 119991
补充文件
