On a Class of Bargaining Schemes for Points in the Core of a Cooperative N-Person Game
MetadataShow full item record
Projection methods of solving convex feasibility problems lead naturally to a class of bargaining scheme's for points in the core of cooperative n-person games. Each such bargaining scheme is by itself a mathematical model of "rational behavior" describing a specific way of achieving "equilibrated" payoff vectors. We show that many of these bargaining schemes are "stable"' and have meaningful heuristic interpretations.