English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Weak Positional Games on Hypergraphs of Rank Three

Kutz, M. (2005). Weak Positional Games on Hypergraphs of Rank Three. In 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (pp. 31-36). Nancy, France: DMTCS.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kutz, Martin1, Author           
Felsner, Stefan, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergraph until either Maker wins by getting a complete edge or all vertices are taken without this happening, a Breaker win. For the class of almost-disjoint hypergraphs of rank three (edges with up to three vertices only and edge-intersections on at most one vertex) we show how to find optimal strategies in polynomial time. Our result is based on a new type of decomposition theorem which might lead to a better understanding of weak positional games in general.

Details

show
hide
Language(s): eng - English
 Dates: 2006-06-022005
 Publication Status: Issued
 Pages: -
 Publishing info: Nancy, France : DMTCS
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279142
Other: Local-ID: C1256428004B93B8-03CCDDD4F2E245CCC12570A70050FD0C-KutzHGames:2004
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Berlin, Germany
Start-/End Date: 2005-09-05

Legal Case

show

Project information

show

Source 1

show
hide
Title: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Nancy, France : DMTCS
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 31 - 36 Identifier: -

Source 2

show
hide
Title: DMTCS Proceedings
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -