The payoff functions of contingent claims (options) of one variable are prominent in Financial Economics and thus assume a fundamental role in option pricing theory. Some of these payoff functions are continuous, piecewise-defined and linear or affine. Such option payoff functions can be analysed in a useful way when they are represented in additive, Boolean normal, graphical and linear form. The issue of converting such payoff functions expressed in the additive, linear or graphical form into an equivalent Boolean normal form, has been considered by several authors for more than half-a-century to better-understand the role of such functions. One aspect of our study is to unify the foregoing different forms of representation, by creating algorithms that convert a payoff function expressed in graphical form into Boolean normal form and then into the additive form and vice versa. Applications of these algorithms are considered in a general theoretical sense and also in the context of specific option contracts wherever relevant. The use of these algorithms have yielded easy computation of the area enclosed by the graph of various functions using min and max operators in several ways, which, in our opinion, are important in option pricing. To summarise, this study effectively dealt with maximum and minimum operators from several perspectives
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:rhodes/vital:931 |
| Date | January 2013 |
| Creators | Seedat, Ebrahim |
| Publisher | Rhodes University, Faculty of Commerce, Economics and Economic History |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis, Doctoral, PhD |
| Format | 249 leaves, pdf |
| Rights | Seedat, Ebrahim |
Page generated in 0.0022 seconds