Axiomatization for Approximate Solutions in Optimization
- 417 Downloads
Approximate solutions to optimization problems are characterized by means of properties like consistency, non-emptiness, behaviour w.r.t. inclusion, invariance w.r.t. translation, multiplication.
KeywordsApproximate optimization consistency invariance properties maximizing sequences vector optimization
Unable to display preview. Download preview PDF.
- Arrow K. J. (1951), Social Choice and Individual Values. Wiley, New York.Google Scholar
- Dontchev A. and Zolezzi T. (1993), Well-posed Optimization Problems. Lecture Notes in Mathematics, 1543, Springer, Berlin.Google Scholar
- Norde H., Patrone F. and Tijs S. (1999), Characterizing Properties of Approximate Solutions to Optimization Problems, Mimeo. To appear in Mathematical Social Sciences.Google Scholar
- Peters H. (1992), Axiomatic bargaining game theory. Kluwer Academic Publishers, Dordrecht.Google Scholar
- Shapley L. S. (1953), A Value for n-Person Games. In: Contributions to the Theory of Games II, (eds.: Kuhn H. W. and Tucker A. W.). Annals of Math. Studies, 28, Princeton University Press, Princeton (NJ): 307–317.Google Scholar