Matrix rationalization via partial orders

DOI10.1007/978-3-031-71033-9_26MaRDI QIDQ7034792zbMATH OpenFDO

Authors Agnes Totschnig, Rohit Vasishta, Adrian Vetta

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71033-9_26

Mathematics Subject Classification ID

Partial orders, general (06A06) Individual preferences (91B08) Voting theory (91B12)

Cites work

• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• `Regular' choice and the weak axiom of stochastic revealed preference
• A decomposition theorem for partially ordered sets
• A Min-Max Theorem on Tournaments
• A representation theorem for finite random scale systems
• A short proof of a theorem of Falmagne.
• Coloring tournaments with few colors: algorithms and complexity
• Decomposing weighted digraphs into sums of chains
• scientific article; zbMATH DE number 3156726 (Why is no real title available?)
• scientific article; zbMATH DE number 3683298 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3086059 (Why is no real title available?)
• Induced binary probabilities and the linear ordering polytope: A status report
• New handbook of mathematical psychology. Volume 1. Foundations and methodology
• On the linear ordering problem and the rankability of data
• Regular choice systems: a general technique to represent them by random variables
• The dichromatic number of a digraph
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The removal lemma for tournaments

This page was built for publication: Matrix rationalization via partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034792)