Testing preferential domains using sampling

Palash Dey, Swaprava Nath, Garima Shakya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A preferential domain is a collection of sets of preferences which are linear orders over a set of alternatives These domains have been studied extensively in social choice theory due to both its practical importance and theoretical elegance Examples of some extensively studied preferential domains include single peaked, single crossing Euclidean, etc In this paper, we study the sample complexity of testing whether a given preference profile is close to some specific domain We consider two notions of closeness: (a) closeness via preferences, and (b) closeness via alternatives We further explore the effect of assuming that the outlier preferences/alternatives to be random (instead of arbitrary) on the sample complexity of the testing problem In most cases, we show that the above testing problem can be solved with high probability for all commonly used domains by observing only a small number of samples (independent of the number of preferences, n, and often the number of alternatives, m) In the remaining few cases, we prove either impossibility results or fl(n) lower bound on the sample complexity We complement our theoretical findings with extensive simulations to figure out the actual constant factors of our asymptotic sample complexity bounds.

Original languageEnglish
Title of host publication18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages855-863
Number of pages9
ISBN (Electronic)9781510892002
Publication statusPublished - 2019
Externally publishedYes
Event18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 - Montreal, Canada
Duration: May 13 2019May 17 2019

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
Country/TerritoryCanada
CityMontreal
Period5/13/195/17/19

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Testing preferential domains using sampling'. Together they form a unique fingerprint.

Cite this