Document Type
Closed Project
Publication Date
2003
Instructor
Timothy Anderson
Course Title
Productivity Analysis
Course Number
EMGT 565/665
Abstract
Abstract
Since the time game theory came into its own with the publication of Von Neumann and Morgenstern classic, and the solution to Zero Sum Games (ZSG) of the maxi-min theorem, attempts have been made to analyze non- zero sum games with the same rigor, with not as much success. Classification have been made, qualitatively on NZSGs, however they provide little in the way of aiding in solving the difficulties one encounters in those games when approached from a quantitative approach. These approaches have been hampered by the lack of methods to analyze the games and are in dire need of new directions for exploration.
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Persistent Identifier
http://archives.pdx.edu/ds/psu/23918
Citation Details
Eisenhauer, William D., "Quantitative Non-Zero Sum Game Classification via Informationtheoretic Reconstructabilty: A Preliminary Research Proposal Exploration" (2003). Engineering and Technology Management Student Projects. 1564.
http://archives.pdx.edu/ds/psu/23918
Comments
This project is only available to students, staff, and faculty of Portland State University