Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions

(1) , (2) , (3, 4, 5) , (6) , (7) , (6)
1
2
3
4
5
6
7

Abstract

In online advertising, search engines sell ad placements for keywords continuously through auctions. This problem can be seen as an infinitely repeated game since the auction is executed whenever a user performs a query with the keyword. As advertisers may frequently change their bids, the game will have a large set of equilibria with potentially complex strategies. In this paper, we propose the use of natural strategies for reasoning in such setting as they are processable by artificial agents with limited memory and/or computational power as well as understandable by human users. To reach this goal, we introduce a quantitative version of Strategy Logic with natural strategies in the setting of imperfect information. In a first step, we show how to model strategies for repeated keyword auctions and take advantage of the model for proving properties evaluating this game. In a second step, we study the logic in relation to the distinguishing power, expressivity, and model-checking complexity for strategies with and without recall.

Dates and versions

hal-03666430 , version 1 (12-05-2022)

Identifiers

Cite

Francesco Belardinelli, Wojciech Jamroga, Vadim Malvone, Munyque Mittelmann, Aniello Murano, et al.. Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions. 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022), International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), May 2022, Auckland (virtual), New Zealand. pp.62--71. ⟨hal-03666430⟩
19 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More