A geometric approach to a class of optimization problems concerning exchangeable binary variables (Q631541): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.spl.2010.11.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980399991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete \(s\)-convex extremal distributions: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An invariance result for homogeneous juries with correlated votes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds on the probability of at least \(k\) successes in \(n\) exchangeable Bernoulli trials as a function of correlation coefficients / rank
 
Normal rank

Latest revision as of 21:29, 3 July 2024

scientific article
Language Label Description Also known as
English
A geometric approach to a class of optimization problems concerning exchangeable binary variables
scientific article

    Statements

    A geometric approach to a class of optimization problems concerning exchangeable binary variables (English)
    0 references
    0 references
    14 March 2011
    0 references
    exchangeable Bernoulli trials
    0 references
    convex polytopes
    0 references
    Condorcet's jury theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references