Journal article
Minimax functions on Galton-Watson trees
- Abstract:
-
We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton–Watson branching process, truncated at some depth 2n, and the terminal values of the level 2n nodes are drawn independently from some common distribution. The case of a regular tree was previously considered by Pearl, who showed that as n → ∞ the value of the game conv...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 569.4KB)
-
- Publisher copy:
- 10.1017/S0963548319000403
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Cambridge University Press Publisher's website
- Journal:
- Combinatorics, Probability and Computing Journal website
- Volume:
- 29
- Issue:
- 3
- Pages:
- 455-484
- Publication date:
- 2019-12-06
- Acceptance date:
- 2019-09-01
- DOI:
- EISSN:
-
1469-2163
- ISSN:
-
0963-5483
- Source identifiers:
-
1048669
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
pubs:1048669
- UUID:
-
uuid:36b8d532-627e-4e4a-8df5-422d58fb3dc1
- Local pid:
- pubs:1048669
- Deposit date:
- 2019-09-02
Terms of use
- Copyright holder:
- Cambridge University Press
- Copyright date:
- 2019
- Rights statement:
- © Cambridge University Press 2019
- Notes:
- This is the accepted manuscript version of the article. The final version is available online from Cambridge University Press at: https://doi.org/10.1017/S0963548319000403
If you are the owner of this record, you can report an update to it here: Report update to this record