IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i4p571-579.html
   My bibliography  Save this article

Compromise for the complaint: an optimization approach to the ENSC value and the CIS value

Author

Listed:
  • Dongshuang Hou
  • Panfei Sun
  • Genjiu Xu
  • Theo Driessen

Abstract

The main goal of this paper is to introduce a new solution concept: the optimal compromise value. We propose two kinds of complaint criteria based on which the optimistic complaint and the pessimistic complaint are defined. Two optimal compromise values are obtained by lexicographically minimizing the optimistic maximal complaint and the pessimistic maximal complaint, respectively. Interestingly, these two optimal compromise values coincide with the ENSC value and the CIS value, respectively. Moreover, these values are characterized in terms of equal maximal complaint property and efficiency. As an adjunct, we reveal the coincidence of the Nucleolus and the ENSC value of 1-convex games.

Suggested Citation

  • Dongshuang Hou & Panfei Sun & Genjiu Xu & Theo Driessen, 2018. "Compromise for the complaint: an optimization approach to the ENSC value and the CIS value," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(4), pages 571-579, April.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:4:p:571-579
    DOI: 10.1057/s41274-017-0251-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0251-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0251-2?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Takayuki Oishi, 2020. "A generalization of Peleg’s representation theorem on constant-sum weighted majority games," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 113-123, April.
    2. Hou, Dongshuang & Lardon, Aymeric, 2020. "An Optimization Characterization of the upper optimal complaint value," Economics Letters, Elsevier, vol. 186(C).
    3. Panfei Sun & Dongshuang Hou & Hao Sun, 2022. "Optimization implementation of solution concepts for cooperative games with stochastic payoffs," Theory and Decision, Springer, vol. 93(4), pages 691-724, November.
    4. Wenzhong Li & Genjiu Xu & Hao Sun, 2020. "Maximizing the Minimal Satisfaction—Characterizations of Two Proportional Values," Mathematics, MDPI, vol. 8(7), pages 1-17, July.
    5. Emilio Calvo Ramón & Esther Gutiérrez-López, 2022. "The equal collective gains value in cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 249-278, March.

    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:taf:tjorxx:v:69:y:2018:i:4:p:571-579. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.