Biased positional games on matroids (Q1765611): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2003.12.015 / rank
Normal rank
 
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.ejc.2003.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048516049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on positional games. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Positional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced sets in an independence structure induced by a submodular function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lehmans switching game and a theorem of Tutte and Nash-Williams / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed switching games on graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution of the Shannon Switching Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semimodular Functions and Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and independence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform families and count matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2003.12.015 / rank
 
Normal rank

Latest revision as of 09:39, 11 December 2024

scientific article
Language Label Description Also known as
English
Biased positional games on matroids
scientific article

    Statements

    Biased positional games on matroids (English)
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    The following game is considered. Two players, Maker and Breaker, alternatively select, respectively, 1 and \(q\) previously unclaimed elements of a given matroid \(M\). Maker wins if he claims all elements of some circuit of \(M\). The game is solved for any \(M\) and \(q\) and the winning strategies are described. In the special case when the matroid \(M\) is defined by a submodular function \(f\), the rank formula is derived, which allows the solution to be expressed in terms of \(f\). The result is applied to positional games on graphs in which, for example, Maker tries to create a cycle or Maker's aim is to obtain a subgraph of given integer density.
    0 references
    Cycle game
    0 references
    Submodular function
    0 references
    Rank function
    0 references

    Identifiers