Simple games versus weighted voting games: bounding the critical threshold value (Q1986594): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00355-019-01221-6 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2975192206 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.08841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal Clutters That Do Not Pack / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of minimal winning coalitions in simple voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Cost of Stabilizing a Cooperative Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting power in the European Union enlargement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing solutions for matching games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small stabilizers for unstable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On power distribution in weighted voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension of simple monotonic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of weighted voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nucleon of cooperative games and an algorithm for matching games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4786439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal winning coalitions in weighted-majority voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha\)-roughly weighted games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension of complete simple games with minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of problems on simple games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three hierarchies of simple games parameterized by ``resource'' parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometric separability of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple games versus weighted voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CLASS OF MAJORITY GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Games: The Least Core and the Nucleolus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nucleolus of weighted cooperative matching games in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Construction of High Dimensional Simple Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource based cooperative games: optimization, fairness and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nucleolus of weighted voting games in pseudo-polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the nucleolus of assignment games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted voting, multicameral representation, and power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127214921 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00355-019-01221-6 / rank
 
Normal rank

Latest revision as of 16:32, 16 December 2024

scientific article
Language Label Description Also known as
English
Simple games versus weighted voting games: bounding the critical threshold value
scientific article

    Statements

    Simple games versus weighted voting games: bounding the critical threshold value (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 April 2020
    0 references
    weighted voting games
    0 references
    simple games
    0 references
    winning coalitions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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