Abstract
The papers [1] and [2] propose algorithms for testing whether the choice function induced by a (strict) preference list of length N over a universe U is substitutable. The running time of these algorithms is O(|U|3⋅N3), respectively O(|U|2⋅N3). In this note we present an algorithm with running time O(|U|2⋅N2). Note that N may be exponential in the size |U| of the universe.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
