Representing and reasoning about auctions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Autonomous Agents and Multi-Agent Systems Année : 2022

Representing and reasoning about auctions

Résumé

The goal of this paper is to propose a framework for representing and reasoning about the rules of auction-based protocols. Such a framework is of interest for building digital marketplaces based on this type of mechanism. Hence the framework should fulfill two requirements: (i) it should enable bidders to express their preferences over combinations of items and (ii) it should allow the mechanism designer to describe the rules governing the market, namely the legality of bids, the allocative choice, and the payment rule. To do so, we define a logical language in the spirit of the Game Description Language, namely Auction Description Language with a set of functions FB (ADL [FB]). ADL [FB] is the first language for describing auctions in a logical framework. With our approach, each stage in a protocol is seen as an independent direct revelation mechanism. Our contribution is three-fold: first, we illustrate the general dimension by representing different kinds of protocols. Second, we show how this machine-processable language enables reasoning about auction properties, including playability, termination, and classical conditions from mechanism design (e.g., budget-balance and individual rationality). Finally, we develop a model-checking algorithm for ADL [FB], with complexity in PTIME when the functions in FB can be computed in polynomial time.
Fichier non déposé

Dates et versions

hal-03605655 , version 1 (11-03-2022)

Identifiants

Citer

Munyque Mittelmann, Sylvain Bouveret, Laurent Perrussel. Representing and reasoning about auctions. Autonomous Agents and Multi-Agent Systems, 2022, 36, pp.article 20. ⟨10.1007/s10458-022-09547-9⟩. ⟨hal-03605655⟩
61 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More