The notion of distortion was introduced by Procaccia and Rosenschein (2006) to quantify the inefficiency of using only ordinal information when trying to maximize the social welfare. Since then, this research area has flourished and bounds on the distortion have been obtained for a wide variety of fundamental scenarios. However, the vast majority of the existing literature is focused on the case where nothing is known beyond the ordinal preferences of the agents over the alternatives. In this paper, we take a more expressive approach, and consider mechanisms that are allowed to further ask a few cardinal queries in order to gain partial access to the underlying values that the agents have for the alternatives. With this extra power, we design new deterministic mechanisms that achieve significantly improved distortion bounds and outperform the best-known randomized ordinal mechanisms. We draw an almost complete picture of the number of queries required to achieve specific distortion bounds.
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries / Amanatidis, Georgios; Birmpas, Georgios; Filos-Ratsikas, Aris; Voudouris, Alexandros. - 34:02(2020), pp. 1782-1789. (Intervento presentato al convegno AAAI 2020 - 34th AAAI Conference on Artificial Intelligence tenutosi a New York, New York, USA) [10.1609/aaai.v34i02.5544].
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
Amanatidis, Georgios
;Birmpas, Georgios
;
2020
Abstract
The notion of distortion was introduced by Procaccia and Rosenschein (2006) to quantify the inefficiency of using only ordinal information when trying to maximize the social welfare. Since then, this research area has flourished and bounds on the distortion have been obtained for a wide variety of fundamental scenarios. However, the vast majority of the existing literature is focused on the case where nothing is known beyond the ordinal preferences of the agents over the alternatives. In this paper, we take a more expressive approach, and consider mechanisms that are allowed to further ask a few cardinal queries in order to gain partial access to the underlying values that the agents have for the alternatives. With this extra power, we design new deterministic mechanisms that achieve significantly improved distortion bounds and outperform the best-known randomized ordinal mechanisms. We draw an almost complete picture of the number of queries required to achieve specific distortion bounds.File | Dimensione | Formato | |
---|---|---|---|
Amanatidis_Peeking_2020.pdf
accesso aperto
Note: DOI: https://doi.org/10.1609/aaai.v34i02.5544
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
517.45 kB
Formato
Adobe PDF
|
517.45 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.