English
Related papers

Related papers: Metric Distortion of Small-group Deliberation

200 papers

We study the effect of probabilistic distortions to the local majority rules used in the Galam model of opinion dynamics and bottom-up hierarchical voting. A different probability for a flip against the local majority within the discussion…

Physics and Society · Physics 2022-05-24 Gabor Toth , Serge Galam

A social system is susceptible to perturbation when its collective properties depend sensitively on a few pivotal components. Using the information geometry of minimal models from statistical physics, we develop an approach to identify…

Physics and Society · Physics 2020-07-06 Edward D. Lee , Daniel M. Katz , Michael J. Bommarito , Paul Ginsparg

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

Complex Variables · Mathematics 2024-11-07 Evgeny Sevost'yanov , Denys Romash , Nataliya Ilkevych

Cook's [J. Roy. Statist. Soc. Ser. B 48 (1986) 133--169] local influence approach based on normal curvature is an important diagnostic tool for assessing local influence of minor perturbations to a statistical model. However, no rigorous…

Statistics Theory · Mathematics 2008-12-18 Hongtu Zhu , Joseph G. Ibrahim , Sikyum Lee , Heping Zhang

Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical…

Artificial Intelligence · Computer Science 2017-07-06 Mario Boley , Bryan R. Goldsmith , Luca M. Ghiringhelli , Jilles Vreeken

Determining whether an algorithmic decision-making system discriminates against a specific demographic typically involves comparing a single point estimate of a fairness metric against a predefined threshold. This practice is statistically…

Machine Learning · Computer Science 2026-03-20 Antonio Ferrara , Francesco Cozzi , Alan Perotti , André Panisson , Francesco Bonchi

The robustness of risk measures to changes in underlying loss distributions (distributional uncertainty) is of crucial importance in making well-informed decisions. In this paper, we quantify, for the class of distortion risk measures with…

Risk Management · Quantitative Finance 2023-03-14 Carole Bernard , Silvana M. Pesenti , Steven Vanduffel

Epistemic social choice aims at unveiling a hidden ground truth given votes, which are interpreted as noisy signals about it. We consider here a simple setting where votes consist of approval ballots: each voter approves a set of…

Computer Science and Game Theory · Computer Science 2021-12-09 Tahar Allouche , Jérôme Lang , Florian Yger

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

Information Theory · Computer Science 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data…

Information Theory · Computer Science 2020-11-11 Nelvin Tan , Jonathan Scarlett

We tackle the problem of template estimation when data have been randomly deformed under a group action in the presence of noise. In order to estimate the template, one often minimizes the variance when the influence of the transformations…

Statistics Theory · Mathematics 2017-07-03 Loïc Devilliers , Stéphanie Allassonnière , Alain Trouvé , Xavier Pennec

We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noiseless, and the case when the measurements are…

Information Theory · Computer Science 2011-07-25 Chun Lam Chan , Pak Hou Che , Sidharth Jaggi , Venkatesh Saligrama

Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no…

Group Theory · Mathematics 2023-06-22 Alex Bishop , Michal Ferov

In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-05 Sharareh Alipour , Ehsan Futuhi , Shayan Karimi

We study the problem of online binary classification in settings where strategic agents can modify their observable features to receive a positive classification. We model the set of feasible manipulations by a directed graph over the…

Machine Learning · Computer Science 2024-07-17 Saba Ahmadi , Kunhe Yang , Hanrui Zhang

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…

Computer Science and Game Theory · Computer Science 2022-02-02 Sonja Kraiczy , Edith Elkind

We model voting behaviour in the multi-group setting of a two-tier voting system using sequences of de Finetti measures. Our model is defined by using the de Finetti representation of a probability measure (i.e. as a mixture of…

Probability · Mathematics 2026-01-14 Gabor Toth

Whereas most dimensionality reduction techniques (e.g. PCA, ICA, NMF) for multivariate data essentially rely on linear algebra to a certain extent, summarizing ranking data, viewed as realizations of a random permutation $\Sigma$ on a set…

Machine Learning · Statistics 2019-09-02 Mastane Achab , Anna Korba , Stephan Clémençon

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to…

Artificial Intelligence · Computer Science 2025-02-25 Wesley H. Holliday , Alexander Kristoffersen , Eric Pacuit

In this paper, we take a statistical decision-theoretic viewpoint on social choice, putting a focus on the decision to be made on behalf of a system of agents. In our framework, we are given a statistical ranking model, a decision space,…

Artificial Intelligence · Computer Science 2016-03-15 Hossein Azari Soufiani , David C. Parkes , Lirong Xia
‹ Prev 1 4 5 6 7 8 10 Next ›