Peeking behind the ordinal curtain: Improving distortion via cardinal queries
| Authors |
|
|---|---|
| Publication date | 2020 |
| Book title | AAAI-20, IAAI-20, EAAI-20 proceedings |
| Book subtitle | Thirty-Fourth AAAI Conference on Artificial Intelligence, Thirty-Second Conference on Innovative Applications of Artificial Intelligence, The Tenth Symposium on Educational Advances in Artificial Intelligence : February 7–12th, 2020, New York Hilton Midtown, New York, New York, USA |
| ISBN |
|
| Series | Proceedings of the AAAI Conference on Artificial Intelligence |
| Event | 34th AAAI Conference on Artificial Intelligence, AAAI 2020 |
| Volume | Issue number | 2 |
| Pages (from-to) | 1782-1789 |
| Number of pages | 8 |
| Publisher | Palo Alto, California: AAAI Press |
| Organisations |
|
| 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. |
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1609/aaai.v34i02.5544 |
| Permalink to this page | |