Now showing items 1-10 of 11
On the Semivalues and the Power Core of Cooperative TU Games
(University of Texas at Arlington, 1999-09)
The Semivalues were introduced axiomatically by P.Dubey, A.Neyman and R.J.Weber (1981) as an important class of values for cooperative TU games. This class contains the Shapley value, the Banzhaf value, and many other ...
Multiweighted Shapley Values and Random Order Values
(University of Texas at Arlington, 1992-03)
Recently, R. J. Weber introduced axiomatically in  the concept of random order value, an operator from [see pdf for notation], the space of TU games, to [see pdf for notation], satisfying linearity, dummy, efficiency ...
Some Recursive Definitions of the Shapley Value and Other Linear Values of Cooperative TU Games
(University of Texas at Arlington, 1997)
Let N be a finite set of players, |N| = n; a cooperative TU game in coalitional form is a function v : P(N) -> R, with v(ø) = 0. It is well known that the set of all games with the set of players N, denoted below G(N), is ...
Potential and Consistency for Semivalues of Finite Cooperative TU Games
(University of Texas at Arlington, 1998-01)
A new axiomatic characterization of the semivalues of finite cooperative n-person games with transferable utilities is given, by using a potential function. The semivalues are proved to be the unique functionals on the ...
The Compensatory Bargaining Set of a Cooperative N-Person Game with Side Payments
(University of Texas at Arlington, 1988-12)
The bargaining sets have been introduced as solution concepts for cooperative n-person games with side payments by R. J. Aumann and M. Maschler (1964). A further study on the relationships between various concepts of ...
New Mathematical Properties of the Banzhaf Value
(University of Texas at Arlington, 1995-01)
In a paper by P. Dubey and L.S. Shapley an axiomatic definition of the Banzhaf value has been extracted from an axiomatic definition of the Banzhaf power index (see ). Briefly speaking, the Banzhaf value axioms can be ...
An Algorithm for Finding the Generalized Nucleolus of a Finite Set and the Multiobjective Discrete Programming Problems
(University of Texas at Arlington, 1982-03)
Greedy and Optimal Paths in a Weighted Graph Without Circuits and Applications to a Class of Optimization Problems on Finite Posets
(University of Texas at Arlington, 1983-05)
In several recent papers B. Korte and L. Lovasz considered a mathematical structure called a simple language on which a greedy algorithm can operate (see [31,J41, OD. The concept of greedoid has been defined by relaxing ...
Bargaining Sets with Thresholds
(University of Texas at Arlington, 1984-02)
A concept of bargaining set for cooperative n person games with side payments has been defined by assuming that a player could be attracted in a new coalition only if his supplementary gain exceeds a fixed threshold and ...
An Average Per Capita Formula for the Shapely Value
(University of Texas at Arlington, 1992-09)
A new formula for the Shapley value is given which does not require the storage of the [see pdf for notation] values of the characteristic function in the computer, and avoids the search in the memory for such data.