Search
Now showing items 1-5 of 5
An Algorithm for Finding the Generalized Nucleolus of a Finite Set and the Multiobjective Discrete Programming Problems
(University of Texas at Arlington, 1982-03)
**Please note that the full text is embargoed**
The Compensatory Bargaining Set of a Big Boss Game
(University of Texas at Arlington, 1989-07)
**Please note that the full text is embargoed** ABSTRACT: The bargaining sets have been introduced as concepts of solution for cooperative n—person games with side payments by R.J.Aumann and M. Maschler (1964) and studied ...
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)
**Please note that the full text is embargoed** ABSTRACT: 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, ...
Bargaining Sets with Thresholds
(University of Texas at Arlington, 1984-02)
**Please note that the full text is embargoed** ABSTRACT: 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 ...
The Compensatory Bargaining Set of a Cooperative N-Person Game with Side Payments
(University of Texas at Arlington, 1988-12)
**Please note that the full text is embargoed** ABSTRACT: 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 ...