2 pages matching fixed payoff in this book
Results 1-2 of 2
What people are saying - Write a review
We haven't found any reviews in the usual places.
2k+l A U B Applying Lemma assume without loss CLASS OF n-PERSON component Construct a sequence contradiction x-d)(N core CORNELL UNIVERSITY d2i+l DEPARTMENT OF OPERATIONS discriminatory solutions distinct pairs domination dorn dP(2j+l easily shown easily verified exists some solution external stability fixed payoff further assume given a solution imputation inequality internally stable ITHACA Lucas n-person game n-player coalitions n-vector necessary and sufficient Neumann-Morgenstern non-empty numbering Operations Research Owen p(j+l pairs of indices paper permutation PI PI player n player receives players are vital Pr(y preceeding proof of Theorem proven receives a fixed satisfying selecting r distinct semi-discriminated semi-discriminatory solution solution discriminating player solution is defined solution K based stable set standard of behavior sufficient condition symmetry Technical Report type are given Unclassified SecuriIy undominated verification follows y2i+l