Assignment problem with preference and an efficient solution method without dissatisfaction

Kengo Saito, Toshiharu Sugawara

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)

    Abstract

    We formulate an assignment problem-solving framework called singleobject resource allocation with preferential order (SORA/PO) to incorporate values of resources and individual preferences into assignment problems. We then devise methods to find semi-optimal solutions for SORA/PO problems. The assignment, or resource allocation, problem is a fundamental problem-solving framework used in a variety of recent network and distributed applications. However, it is a combinatorial problem and has a high computational cost to find the optimal solution. Furthermore, SORA/PO problems require solutions in which participating agents express no or few dissatisfactions on the basis of the relationship between relative values and the agents’ preference orders. The algorithms described herein can efficiently find a semi-optimal solution that is satisfactory to almost all agents even though its sum of values is close to that of the optimal solution. We experimentally evaluate our methods and the derived solutions by comparing them with tho optimal solutions calculated by CPLEX. We also compare the running times for the solution obtained by these methods.

    Original languageEnglish
    Title of host publicationAgent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings
    PublisherSpringer Science and Business Media Deutschland GmbH
    Pages33-44
    Number of pages12
    Volume58
    ISBN (Print)9783319398822
    DOIs
    Publication statusPublished - 2016
    Event10th KES International Conference on Agent and Multi-Agent Systems: Technology and Applications, KES-AMSTA 2016 - Puerto de la Cruz, Tenerife, Spain
    Duration: 2016 Jun 152016 Jun 17

    Publication series

    NameSmart Innovation, Systems and Technologies
    Volume58
    ISSN (Print)21903018
    ISSN (Electronic)21903026

    Other

    Other10th KES International Conference on Agent and Multi-Agent Systems: Technology and Applications, KES-AMSTA 2016
    CountrySpain
    CityPuerto de la Cruz, Tenerife
    Period16/6/1516/6/17

    Fingerprint

    Resource allocation
    Assignment problem
    Dissatisfaction
    Optimal solution
    Costs
    Problem solving

    Keywords

    • Assignment problem
    • Cardinal and ordinal values
    • Preference
    • Resource allocation problem

    ASJC Scopus subject areas

    • Computer Science(all)
    • Decision Sciences(all)

    Cite this

    Saito, K., & Sugawara, T. (2016). Assignment problem with preference and an efficient solution method without dissatisfaction. In Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings (Vol. 58, pp. 33-44). (Smart Innovation, Systems and Technologies; Vol. 58). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-39883-9_3

    Assignment problem with preference and an efficient solution method without dissatisfaction. / Saito, Kengo; Sugawara, Toshiharu.

    Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings. Vol. 58 Springer Science and Business Media Deutschland GmbH, 2016. p. 33-44 (Smart Innovation, Systems and Technologies; Vol. 58).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Saito, K & Sugawara, T 2016, Assignment problem with preference and an efficient solution method without dissatisfaction. in Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings. vol. 58, Smart Innovation, Systems and Technologies, vol. 58, Springer Science and Business Media Deutschland GmbH, pp. 33-44, 10th KES International Conference on Agent and Multi-Agent Systems: Technology and Applications, KES-AMSTA 2016, Puerto de la Cruz, Tenerife, Spain, 16/6/15. https://doi.org/10.1007/978-3-319-39883-9_3
    Saito K, Sugawara T. Assignment problem with preference and an efficient solution method without dissatisfaction. In Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings. Vol. 58. Springer Science and Business Media Deutschland GmbH. 2016. p. 33-44. (Smart Innovation, Systems and Technologies). https://doi.org/10.1007/978-3-319-39883-9_3
    Saito, Kengo ; Sugawara, Toshiharu. / Assignment problem with preference and an efficient solution method without dissatisfaction. Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings. Vol. 58 Springer Science and Business Media Deutschland GmbH, 2016. pp. 33-44 (Smart Innovation, Systems and Technologies).
    @inproceedings{cfc7ef7e7ad64eb4891b34fb8e21ca42,
    title = "Assignment problem with preference and an efficient solution method without dissatisfaction",
    abstract = "We formulate an assignment problem-solving framework called singleobject resource allocation with preferential order (SORA/PO) to incorporate values of resources and individual preferences into assignment problems. We then devise methods to find semi-optimal solutions for SORA/PO problems. The assignment, or resource allocation, problem is a fundamental problem-solving framework used in a variety of recent network and distributed applications. However, it is a combinatorial problem and has a high computational cost to find the optimal solution. Furthermore, SORA/PO problems require solutions in which participating agents express no or few dissatisfactions on the basis of the relationship between relative values and the agents’ preference orders. The algorithms described herein can efficiently find a semi-optimal solution that is satisfactory to almost all agents even though its sum of values is close to that of the optimal solution. We experimentally evaluate our methods and the derived solutions by comparing them with tho optimal solutions calculated by CPLEX. We also compare the running times for the solution obtained by these methods.",
    keywords = "Assignment problem, Cardinal and ordinal values, Preference, Resource allocation problem",
    author = "Kengo Saito and Toshiharu Sugawara",
    year = "2016",
    doi = "10.1007/978-3-319-39883-9_3",
    language = "English",
    isbn = "9783319398822",
    volume = "58",
    series = "Smart Innovation, Systems and Technologies",
    publisher = "Springer Science and Business Media Deutschland GmbH",
    pages = "33--44",
    booktitle = "Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings",

    }

    TY - GEN

    T1 - Assignment problem with preference and an efficient solution method without dissatisfaction

    AU - Saito, Kengo

    AU - Sugawara, Toshiharu

    PY - 2016

    Y1 - 2016

    N2 - We formulate an assignment problem-solving framework called singleobject resource allocation with preferential order (SORA/PO) to incorporate values of resources and individual preferences into assignment problems. We then devise methods to find semi-optimal solutions for SORA/PO problems. The assignment, or resource allocation, problem is a fundamental problem-solving framework used in a variety of recent network and distributed applications. However, it is a combinatorial problem and has a high computational cost to find the optimal solution. Furthermore, SORA/PO problems require solutions in which participating agents express no or few dissatisfactions on the basis of the relationship between relative values and the agents’ preference orders. The algorithms described herein can efficiently find a semi-optimal solution that is satisfactory to almost all agents even though its sum of values is close to that of the optimal solution. We experimentally evaluate our methods and the derived solutions by comparing them with tho optimal solutions calculated by CPLEX. We also compare the running times for the solution obtained by these methods.

    AB - We formulate an assignment problem-solving framework called singleobject resource allocation with preferential order (SORA/PO) to incorporate values of resources and individual preferences into assignment problems. We then devise methods to find semi-optimal solutions for SORA/PO problems. The assignment, or resource allocation, problem is a fundamental problem-solving framework used in a variety of recent network and distributed applications. However, it is a combinatorial problem and has a high computational cost to find the optimal solution. Furthermore, SORA/PO problems require solutions in which participating agents express no or few dissatisfactions on the basis of the relationship between relative values and the agents’ preference orders. The algorithms described herein can efficiently find a semi-optimal solution that is satisfactory to almost all agents even though its sum of values is close to that of the optimal solution. We experimentally evaluate our methods and the derived solutions by comparing them with tho optimal solutions calculated by CPLEX. We also compare the running times for the solution obtained by these methods.

    KW - Assignment problem

    KW - Cardinal and ordinal values

    KW - Preference

    KW - Resource allocation problem

    UR - http://www.scopus.com/inward/record.url?scp=84979022767&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84979022767&partnerID=8YFLogxK

    U2 - 10.1007/978-3-319-39883-9_3

    DO - 10.1007/978-3-319-39883-9_3

    M3 - Conference contribution

    SN - 9783319398822

    VL - 58

    T3 - Smart Innovation, Systems and Technologies

    SP - 33

    EP - 44

    BT - Agent and Multi-Agent Systems: Technology and Applications - 10th KES International Conference, KES-AMSTA 2016, Proceedings

    PB - Springer Science and Business Media Deutschland GmbH

    ER -