On a Formulation of Discrete, N-Person Non Cooperative Games.
On best proximity pair theorems and fixed-point theorems.
On convex combinations of two values
We study values for cooperative TU-games which are convex combinations of the Shapley value and the solidarity value, introduced in our recent paper [1]. First, we axiomatize the convex combination of the two values in the case when the coefficients are given exogenously. Next, we give an axiomatic description of the whole family of such values.
On the complexity of -player Hackenbush.
On the complexity of the Shapley-Scarf economy with several types of goods
In the Shapley-Scarf economy each agent is endowed with one unit of an indivisible good (house) and wants to exchange it for another, possibly the most preferred one among the houses in the market. In this economy, core is always nonempty and a core allocation can be found by the famous Top Trading Cycles algorithm. Recently, a modification of this economy, containing Q >= 2 types of goods (say, houses and cars for Q=2) has been introduced. We show that if the number of agents is 2, a complete...
On the first occurrence of strings.