Extension of the 'Gambler's Ruin' problem played over networks
In this thesis we consider the problem of extending and adapting the classical Gambler's Ruin (GR) problem so that it can be played over net-works in a manner consistent with both the classical two-player and the fully connected N-player GR problem. We introduce an extended GR problem, in which...
Main Author: | Chamberlain, Nira |
---|---|
Other Authors: | Osbaldestin, Andrew Harold ; Burbanks, Andrew David |
Published: |
University of Portsmouth
2013
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.617818 |
Similar Items
-
Bayesian sampling in contextual-bandit problems with extensions to unknown normal-form games
by: May, Benedict C.
Published: (2013) -
Complexity classifications for the valued constraint satisfaction problem
by: Powell, Robert David
Published: (2016) -
Modelling human fairness in cooperative games : a goal programming approach
by: Zaibidi, Nerda Zura
Published: (2012) -
Non-cooperative game theoretic approaches to bilateral exchange networks
by: Prangle, Dennis
Published: (2005) -
Hide-and-seek and other search games
by: Lidbetter, Thomas
Published: (2013)