Efficient computability is an important property of solution concepts. We consider the computational complexity of finding and verifying various solution concepts in trading networks—multi-sided matching markets with bilateral contracts and without transferable utility—under the assumption...

Az új választási törvény egyik célja a korábbinál igazságosabb választási körzetek kialakítása. Ezt a Velencei Bizottság választási kódexében megfogalmazott ajánlásokhoz hasonló, bár azoknál némileg megengedőbb szabályok révén biztosítja. A szabályok rögzítik a...

Low-carbon hydrogen is a promising option for energy security and decarbonization. Cooperation is needed to ensure the widespread use of low-carbon energy. Cooperation among hydrogen supply chain (HSC) agents is essential to overcome the high costs, the lack of infrastructure that needs heavy...

We consider linearly weighted versions of the least core and the (pre)nuceolus and investigate the 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...

In a liability problem, the asset value of an insolvent firm must be distributed among the creditors and the firm itself, when the firm has some freedom in negotiating with the creditors. We model the negotiations using cooperative game theory and analyze the Shapley value to resolve such...

It is well known that in assignment markets competitive prices always exist, but no price mechanism is strategy-proof for all agents. We investigate the extent a single agent can influence three special competitive price vectors by misreporting his/her reservation values. We provide an exact...

This paper studies matching markets in the presence of middlemen. In our framework, a buyer–seller pair may either trade directly or use the services of a middleman; and a middleman may serve multiple buyer–seller pairs. For each such market, we examine the associated TU game. We first show...

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;...

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 consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We...