Top-pair and top-triple monotonicity
From MaRDI portal
Publication:2431836
Recommendations
- Upper bound for monoidal topological complexity
- Monotonicity properties of operations on generalized topologies
- scientific article; zbMATH DE number 3895062
- Pairwise counter-monotonicity
- scientific article; zbMATH DE number 1294289
- scientific article; zbMATH DE number 934585
- Topological rigidity as a monoidal equivalence
- Monotonicity and duality
- scientific article; zbMATH DE number 3946418
- scientific article; zbMATH DE number 3868195
Cites work
- scientific article; zbMATH DE number 3864918 (Why is no real title available?)
- Arrow's theorem and the Gibbard-Satterthwaite theorem: A unified approach
- Dictatorial domains
- Manipulation of Voting Schemes: A General Result
- Monotonicity implies generalized strategy-proofness for correspondences
- Nash Equilibrium and Welfare Optimality
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
Cited in
(12)- Recognizing top-monotonic preference profiles in polynomial time
- A note on monotonicity in iterated choice functions
- Minimal monotonic extensions of scoring rules
- Characterizing the top cycle via strategyproofness
- Characterizing the resolute part of monotonic social choice correspondences
- Recovering non-monotonicity problems of voting rules
- One-way monotonicity as a form of strategy-proofness
- Top monotonicity: a common root for single peakedness, single crossing and the median voter result
- Anonymity, monotonicity, and quota pair systems
- Update monotone preference rules
- Monotonicity properties and their adaptation to irresolute social choice rules
- Interacting double monotonicity failure with direction of impact under five voting methods
This page was built for publication: Top-pair and top-triple monotonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431836)
