Construction of aggregation paradoxes through load-sharing models

DOI10.1017/apr.2022.17zbMath1523.60141OpenAlexW4290635788MaRDI QIDQ6159384

Emilio De Santis, Fabio L. Spizzichino

Publication date: 5 May 2023

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/apr.2022.17

zbMATH Keywords

voting theoryaggregation paradoxesmajority graphsranking patternsminima among random variablesorder-dependent load-sharing

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Decision theory (91B06) Voting theory (91B12) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Related Items (1)

Construction of voting situations concordant with ranking patterns

Cites Work

• First occurrence of a word among the elements of a finite dictionary in random sequences of letters
• Comparisons of coherent systems using stochastic precedence
• Extensions of system signatures to dependent lifetimes: explicit expressions and interpretations
• The Borda dictionary
• Applications of average and projected systems to the study of coherent systems
• What majority decisions are possible
• A dictionary for voting paradoxes
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• Inverted orders for monotone scoring rules
• String overlaps, pattern matching, and nontransitive games
• On the asymptotic distribution theory of a class of consistent estimators of a distribution satisfying a uniform stochastic ordering constraint.
• Voting paradoxes and digraphs realizations
• Diagonal sections of copulas, multivariate conditional hazard rates and distributions of order statistics for minimally stable lifetimes
• A correspondence between voting procedures and stochastic orderings
• The probability of intransitivity in dice and close elections
• Stochastic precedence and minima among dependent variables
• Elections, voting rules and paradoxical outcomes
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
• System signatures and their applications in engineering reliability
• How many random digits are required until given sequences are obtained?
• The Paradox of Nontransitive Dice
• The stochastic precedence ordering with applications in sampling and testing
• A chaotic Exploration of Aggregation Paradoxes
• GENERALIZATION OF THE PAIRWISE STOCHASTIC PRECEDENCE ORDER TO THE SEQUENCE OF RANDOM VARIABLES
• Reliability, signature, and relative quality functions of systems under time‐homogeneous load‐sharing models
• RELATIONS BETWEEN STOCHASTIC ORDERINGS AND GENERALIZED STOCHASTIC PRECEDENCE
• Some Probability Paradoxes in Choice from Among Random Alternatives
• Ranking graphs through hitting times of Markov chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of aggregation paradoxes through load-sharing models