Abstract
In this paper, we offer for two-person games an alternative characterization of Iterated Kalai-Smorodinsky-Nash Compromise (IKSNC), which was introduced and first characterized by Saglam (2016) for $n$-person games. We present an axiom called Gamma-Decomposability, satisfied by any solution that is decomposable with respect to a given reference solution Gamma. We then show that the IKSNC solution is uniquely characterized by Gamma-Decomposability whenever Gamma satisfies the standard axioms of Independence of Equivalent Utility Representations and Symmetry, along with three additional axioms, namely Restricted Monotonicity of Individually Best Extensions, Weak Independence of Irrelevant Alternatives, and Weak Pareto Optimality under Symmetry.
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.
