Dual representation of cooperative games based on Fenchel-Moreau conjugation

Optimization

Volumn 36, Issue 4, 1996, Pages 291-319

  Martinez Legaz J E ^a  

^a NONE

Author keywords

Convex analysis; Cooperative games; Fenchel Moreau conjugation

Indexed keywords

EID: 0030478619     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939608844186     Document Type: Article

References (11)

1. Auslender, A. (1976). Optimisation. Méthodes Numériques, Masson, Paris New York Barcelone Millan.
2. Durier, R. (1988). On Locally Polyhedral Convex Functions. In Hoffmann, K.H., Hiriart-Urruty, JB., Lemarechal, C. and Zowe, J. (eds). Trends in Mathematical Optimization, Birkhäuser-Verlag, Basel, Boston, pp. 55-66.
3. Klee, V. L. (1959). Some characterizations of convex polyhedra. Acta Mathematica, 102:79-107.
4. Martínez-Legaz, J.-E., Singer, I. (1990). Dualities Between Complete Lattices. Optimization, 21:481-508.
5. Moreau, J. J. (1970). Inf-convolution, Sous-additivité, Convexité des Fonctions Numériques. Journal de Mathématiques Pures et Appliquées, 49:109-154.
6. Myerson, R. B. (1991). Game Theory. Analysis of Conflict. Harvard University Press, Cambridge, London.
7. Pérez-Castrillo, J. D. (1994). Cooperative Outcomes through Noncooperative Games, Games and Economic Behavior, 7:428-440.
8. Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press, Princeton.
9. Rosenmüller, J. (1981). The Theory of Games and Markets. North-Holland, Amsterdam New York
10. Shapley, L. S. (1971). Cores of Convex Games. International Journal of Game Theory, 1:12-26.
11. Singer, I. (1984-85). Extensions of Functions of 0-1 Variables and Applications to Combinatorial Optimization. Numerical Functional Analysis and Optimization, 7:23-62.