Reconfirming the Prenucleolus

نویسندگان

  • Guni Orshan
  • Peter Sudhölter
چکیده

By means of an example it is shown that the prenucleolus is not the only minimal solution that satisfies nonemptiness, Pareto optimality, covariance, the equal treatment property and the reduced game property, even if universe of players is infinite. This example also disproves a conjecture of Gurvich et al. Moreover, we prove that the prenucleolus is axiomatized by nonemptiness, covariance, the equal treatment property, and the reconfirmation property, provided the universe of players is infinite.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Monotonic Core Concept for Convex Games: the Sd-prenucleolus

We prove that the SD-prenucleolus satis…es monotonicity in the class of convex games. The SD-prenucleolus is thus the only known continuous core concept that satis…es monotonicity for convex games. We also prove that for convex games the SD-prenucleolus and the SD-prekernel coincide. Keywords: TU games, prenucleolus, monotonicity. Keywords: TU games, prenucleolus, monotonicity JEL classi…cation...

متن کامل

The SD-prenucleolus for TU games

We introduce and characterize a new solution concept for TU games. The new solution is called SD-prenucleolus and is a lexicographic value although is not a weighted prenucleolus. The SD-prenucleolus satis…es several desirable properties and is the only known solution that satis…es core stability, strong aggregate monotonicity and null player out property in the class of balanced games. The SD-...

متن کامل

The prenucleolus for games with restricted cooperation

A game with a restricted cooperation is a triple (N, v,Ω), where N is a finite set of players, Ω ⊂ 2 , N ∈ Ω is a collection of feasible coalitions, v : Ω→ R is a characteristic function. The definition implies that if Ω = 2 , then the game (N, v,Ω) = (N, v) is the classical TU cooperative game. The class of all games with a restricted cooperation G with an arbitrary universal set of players is...

متن کامل

Fast computation of the leastcore and prenucleolus of cooperative games

The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among N players. It has, however, the drawback being a linear programming problem with 2 − 2 constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approa...

متن کامل

On the coincidence of the prenucleolus and the Shapley value

We identify a sufficient class of coalitional form games with transferable utility for which prenucleolus coincides with the Shapley value. We then apply our result to simple games and to generalized queueing games. Department of Economics, University of Warwick, Coventry, United Kingdom Economic Research Unit, Indian Statistical Institute, Kolkata, India Department of Economics, University of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2003