Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that...

We study linearly weighted versions of the least core and the (pre)nucleolus and investigatethe reduction possibilities in their computation. We slightly extend some well-known related results and establish their counterparts by using the dual game. Our main results imply, for example, that if...

Két új lexikografikus allokációs eljárást vizsgálunk: a leximin és a leximax eljárásokat. Ezek abban hasonlítanak a jól ismert marginális allokációs eljáráshoz, hogy (i) a kifizetések meghatározása itt is a játékosok egy eleve adott prioritási sorrendjében történik;...