An improved algorithm for testing substitutability of weak preferences

DOI10.1016/J.MATHSOCSCI.2019.02.003MaRDI QIDQ2334856zbMATH OpenOpenAlexWikidataFDO

Authors Susumu Kawanaka, Naoyuki Kamiyama

Publication date 8 November 2019

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2019.02.003

zbMATH Keywords

weak preferencessubstitutability testing algorithm

Mathematics Subject Classification ID

Individual preferences (91B08)

Recommendations

• Testing substitutability of weak preferences
• Revealed preference tests for weak separability: an integer programming approach
• An observation on Gross substitutability and the weak axiom of revealed preference
• Gross substitutability and the weak axiom of revealed preference
• A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
• A Complementary Approach to the Strong and Weak Axioms of Revealed Preference
• Revealed preference tests for consistency with weakly separable indirect utility
• An algebraic approach to revealed preference
• Substitution with satiation: a new class of utility functions and a complementary pivot algorithm

Cites work

• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage
• On testing substitutability
• Testing substitutability
• Testing substitutability of weak preferences
• Three remarks on the many-to-many stable matching problem

Cited in

(3)

• Testing substitutability of weak preferences
• Testing substitutability
• On testing substitutability

This page was built for publication: An improved algorithm for testing substitutability of weak preferences

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