IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v99y2019icp1-4.html
   My bibliography  Save this article

An improved algorithm for testing substitutability of weak preferences

Author

Listed:
  • Kawanaka, Susumu
  • Kamiyama, Naoyuki

Abstract

In this paper, we consider the problem of testing substitutability of weak preferences. For this problem, Aziz, Brill, and Harrenstein proposed an O(ℓ3u2+ℓ2u2s2)-time algorithm, where u is the size of the ground set, ℓ is the number of acceptable sets, and s is the maximum size of an equivalent class. In this paper, we propose an O(ℓ3u+ℓ2u2s)-time algorithm for this problem. Our algorithm is based on a generalization of the characterization of substitutability of strict preferences given by Croitoru and Mehlhorn.

Suggested Citation

  • Kawanaka, Susumu & Kamiyama, Naoyuki, 2019. "An improved algorithm for testing substitutability of weak preferences," Mathematical Social Sciences, Elsevier, vol. 99(C), pages 1-4.
    • Handle: RePEc:eee:matsoc:v:99:y:2019:i:c:p:1-4
    DOI: 10.1016/j.mathsocsci.2019.02.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489619300150
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2019.02.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:99:y:2019:i:c:p:1-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.