Use this URL to cite or link to this record in EThOS:
Title: Nash equilibria in games and simplicial complexes
Author: Egan, Sarah
ISNI:       0000 0004 2675 1443
Awarding Body: University of Bath
Current Institution: University of Bath
Date of Award: 2008
Availability of Full Text:
Access from EThOS:
Access from Institution:
Nash's Theorem is a famous and widely used result in non-cooperative game theory which can be applied to games where each player's mixed strategy payoff function is defined as an expectation. Current proofs of this Theorem neither justify why this constraint is necessary or satisfactorily identifies its origins. In this Thesis we change this and prove Nash's Theorem for abstract games where, in particular, the payoff functions can be replaced by total orders. The result of this is a combinatoric proof of Nash's Theorem. We also construct a generalised simplicial complex model and demonstrate a more general form of Nash's Theorem holds in this setting. This leads to the realisation Nash's Theorem is not a consequence of a fixed-point theorem but rather a combinatoric phenomenon existing in a much more general mathematical model.
Supervisor: Vorobjov, Nicolai Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: nash's theorem ; game theory