Publication: Imperfections in random tournaments
Imperfections in random tournaments
Date
Date
Date
Citations
Barbour, A. D., Godbole, A., & Qian, J. (1997). Imperfections in random tournaments. Combinatorics, Probability & Computing, 6(1), 1–15. https://doi.org/10.1017/S0963548396002829
Abstract
Abstract
Abstract
A tournament T on a set V of n players is an orientation of the edges of the complete graph Kn on V; T will be called a random tournament if the directions of these edges are determined by a sequence {Yj[ratio]j = 1, …, (n2)} of independent coin flips. If (y, x) is an edge in a (random) tournament, we say that y beats x. A set A [subset or is implied by] V, |A| = k, is said to be beaten if there exists a player y [notin N: negated set membership] A such that y beats x for each x [set membership] A. If such a y does not exist, we say t
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Barbour, A D
- Qian, J
Journal/Series Title
Journal/Series Title
Journal/Series Title
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
Additional Information
Additional Information
Additional Information
OA Status
OA Status
OA Status
Publisher DOI
Metrics
Downloads
Views
Citations
Barbour, A. D., Godbole, A., & Qian, J. (1997). Imperfections in random tournaments. Combinatorics, Probability & Computing, 6(1), 1–15. https://doi.org/10.1017/S0963548396002829
