Explaining Preferences by Multiple Patterns in Voters' Behavior

@inproceedings{Kraiczy2022ExplainingPB,
  title={Explaining Preferences by Multiple Patterns in Voters' Behavior},
  author={Sonja Kraiczy and Edith Elkind},
  booktitle={International Joint Conference on Artificial Intelligence},
  year={2022}
}
In some preference aggregation scenarios, voters' preferences are highly structured: e.g., the set of candidates may have one-dimensional structure (so that voters' preferences are single-peaked) or be described by a binary decision tree (so that voters' preferences are group-separable). However, sometimes a single axis or a decision tree is insufficient to capture the voters' preferences; rather, there is a small number K of axes or decision trees such that each vote in the profile is… 

Exact Learning of Preference Structure: Single-peaked Preferences and Beyond

This work considers the setting where the members of a society (voters) have preferences over candidates, and the candidates can be ordered on an axis so that the voters’ preferences are single-peaked on this axis and obtains tight bounds on the number of samples required and shows that, surprisingly, the bounds are independent of thenumber of candidates.

References

SHOWING 1-10 OF 33 REFERENCES

On Recognising Nearly Single-Crossing Preferences

This work considers three distance measures, which are based on partitioning voters or candidates or performing a small number of swaps in each vote, and proves that it can be efficiently decided if voters can be split into two single-crossing groups.

Correlating Preferences and Attributes: Nearly Single-Crossing Profiles

The goal of this paper is to evaluate the computational feasibility of using social choice theory to develop correlation coefficients between ranked preferences and an ordinal attribute such as educational attainment or income level, and to investigate the complexity of computing these distances.

On Detecting Nearly Structured Preference Profiles

This paper shows that single-peaked and single-crossing elections and other domains that can be characterized in terms of forbidden configurations admit efficient approximation algorithms and results are optimal under a plausible complexity-theoretic assumption.

Are there any nicely structured preference profiles nearby?

On the Computation of Fully Proportional Representation

This work investigates two systems of fully proportional representation suggested by Chamberlin & Courant and Monroe and investigates the parameterized complexity of winner determination of the two classical and two new rules with respect to several parameters.

The complexity of election problems with group-separable preferences

Under this assumption the voters have group-separable preferences, the problems typically remain NP -hard, but the algorithms provided provide more efficient algorithms if additionally the clone decomposition tree is of moderate height.

On the Complexity of Constructive Control under Nearly Single-Peaked Preferences

It is proved that for every $3-regular bipartite graph, there are two linear orders of its vertices such that the two endpoints of every edge are consecutive in at least one of the two orders.

An Exploration in the Theory of Optimum Income Taxation

you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal,

A characterization of the single-crossing domain

We characterize single-crossing preference profiles in terms of two forbidden substructures, one of which contains three voters and six (not necessarily distinct) alternatives, and one of which