Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
An Asymmetric Kalai-Smorodinsky Solution
View through CrossRef
I define a restricted version of Nash's Independence that overcomes its major criticisms and then show that a one parameter class of asymmetric Kalai-Smorodinsky solutions is characterized by Restricted Independence, Scale Invariance, Pareto Optimality and Kalai and Smorodinsky's Individual Monotonicity.
Title: An Asymmetric Kalai-Smorodinsky Solution
Description:
I define a restricted version of Nash's Independence that overcomes its major criticisms and then show that a one parameter class of asymmetric Kalai-Smorodinsky solutions is characterized by Restricted Independence, Scale Invariance, Pareto Optimality and Kalai and Smorodinsky's Individual Monotonicity.
Related Results
The Kalai-Smorodinsky Solution in Labor-Market Negotiations
The Kalai-Smorodinsky Solution in Labor-Market Negotiations
Authors who consider efficient bargaining on the labor market predominantly focus on the Nash-bargaining solution. It seems, however, that actual labor market negotiations between ...
Bargaining solutions in heterogeneous networks: A reinforcement learning‐based approach
Bargaining solutions in heterogeneous networks: A reinforcement learning‐based approach
AbstractTo enhance the performance and the coverage area of the next‐generation heterogeneous wireless networks (HetNets), smaller cells such as femtocells are deployed. A reasonab...
Coopetitive Games for Management of Marine Transportation Activity: A Study Case
Coopetitive Games for Management of Marine Transportation Activity: A Study Case
In this paper, we will use coopetitive game theory to analyze a case of real coopetition among port companies, for what concerns loading and unloading of goods, within a competitiv...
Realizing the Asymmetric Index of a Graph
Realizing the Asymmetric Index of a Graph
A graph G is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi Erdos [1]. They suggested the problem of starting with ...
MUKSB:Machine Unlearning via Kalai-Smorodinsky Bargaining
MUKSB:Machine Unlearning via Kalai-Smorodinsky Bargaining
Modern generative models are continuously updated and adapted rather than remaining fixed after training, which introduces growing concerns around privacy leakage and unintended ex...
Axiomatic Characterization of the Nash and Kalai-Smorodinsky Solutions for Integer Allocation Problems
Axiomatic Characterization of the Nash and Kalai-Smorodinsky Solutions for Integer Allocation Problems
We consider two-player integer allocation problems and provide axiomatic characterizations of adaptations of the Nash (1950) and Kalai-Smorodinsky (1975) solutions for such problem...
Procedure for Western blot v1
Procedure for Western blot v1
Goal: This document has the objective of standardizing the protocol for Western blot. This technique allows the detection of specific proteins separated on polyacrylamide gel and t...
Knowledge transfer in international asymmetric alliances: the key role of translation, artifacts, and proximity
Knowledge transfer in international asymmetric alliances: the key role of translation, artifacts, and proximity
PurposeThe purpose of this paper is to analyze the issue of knowledge transfer in the context of international asymmetric alliances. The objective is mainly to identify the barrier...