Abstract
In this chapter a theory of discrete optimization called discrete convex analysis will be introduced. For a comprehensive treatment we refer the reader to Stoer and Witzgall [227], Fujishige [96, Chapter IV], and Murota [179] [181]. Martínez-Legaz [165] seems to have been the first writer to apply the discrete convex analysis to the cooperative game theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bilbao, J.M. (2000). Discrete convex analysis. In: Cooperative Games on Combinatorial Structures. Theory and Decision Library, vol 26. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4393-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4393-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6976-9
Online ISBN: 978-1-4615-4393-0
eBook Packages: Springer Book Archive