Inferring Relative Ability from Winning Probability in Multientrant Contests (Q4987717): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Place probabilities in normal order statistics models for horse races / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/19m1276261 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3134225883 / rank
 
Normal rank

Latest revision as of 10:44, 30 July 2024

scientific article; zbMATH DE number 7343458
Language Label Description Also known as
English
Inferring Relative Ability from Winning Probability in Multientrant Contests
scientific article; zbMATH DE number 7343458

    Statements

    Inferring Relative Ability from Winning Probability in Multientrant Contests (English)
    0 references
    0 references
    4 May 2021
    0 references
    order statistics
    0 references
    rank statistics
    0 references
    trifecta
    0 references
    exacta
    0 references
    quinella
    0 references
    Baseball Pythagorean theorem
    0 references
    inverse problems
    0 references
    horse racing
    0 references
    handicapping
    0 references
    asset pricing
    0 references
    coherent probability
    0 references
    risk-neutral pricing
    0 references
    web search
    0 references

    Identifiers