Compromise solutions based on bankruptcy
نویسندگان
چکیده
منابع مشابه
Compromise solutions for bankruptcy situations with references
This paper deals with bankruptcy situations in which in addition to the claims, an exogenously given reference point for the allocation of the estate is present. We introduce and analyse two types of compromise solutions and show that they coincide with the τ value of two corresponding TU games. We apply our solutions to a real-life case of allocating university money to degree courses. JEL-cod...
متن کاملA Compromise Stable Extension of Bankruptcy Games: Multipurpose Resource Allocation
This paper considers situations characterized by a common-pool resource, which needs to be divided among agents. Each of the agents has some claim on this pool and an individual reward function for assigned resources. This paper analyzes not only the problem of maximizing the total joint reward, but also the allocation of these rewards among the agents. Analyzing these situations a new class of...
متن کاملOn Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagent problems in which the value of a decision must be evaluated according to several viewpoints, sometimes conflicting. Although most of the studies concentrate on the determination of the set of Pareto-optimal policies...
متن کاملBankruptcy Prediction based on Independent Component Analysis
Bankruptcy prediction is of great importance in financial statement analysis to minimize the risk of decision strategies. It attempts to separate distress companies from healthy ones according to some financial indicators. Since the real data usually contains irrelevant, redundant and correlated variables, it is necessary to reduce the dimensionality before performing the prediction. In this pa...
متن کاملCompromise Solutions in Multicriteria Combinatorial Optimization
In multicriteria optimization, a compromise solution is a feasible solution whose cost vector minimizes the distance to the ideal point w.r.t. a given norm. The coordinates of the ideal point are given by the optimal values for the single optimization problem for each criterion. We show that the concept of compromise solutions fits nicely into the existing notion of Pareto optimality: For a hug...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Social Sciences
سال: 2006
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2006.01.002