Matches in SemOpenAlex for { <https://semopenalex.org/work/W268115422> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W268115422 abstract "Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc. The infinite games on finite graphs we study in this thesis have their primary applications in verification, but are also of fundamental importance from the complexity-theoretic point of view. They include parity, mean payoff, and simple stochastic games. We focus on solving graph games by using iterative strategy improvement and methods from linear programming and combinatorial optimization. To this end we consider old strategy evaluation functions, construct new ones, and show how all of them, due to their structural similarities, fit into a unifying combinatorial framework. This allows us to employ randomized optimization methods from combinatorial linear programming to solve the games in expected subexponential time. We introduce and study the concept of a controlled optimization problem, capturing the essential features of many graph games, and provide sufficent conditions for solvability of such problems in expected subexponential time. The discrete strategy evaluation function for mean payoff games we derive from the new controlled longest-shortest path problem, leads to improvement algorithms that are considerably more efficient than the previously known ones, and also improves the efficiency of algorithms for parity games. We also define the controlled linear programming problem, and show how the games are translated into this setting. Subclasses of the problem, more general than the games considered, are shown to belong to NP intersection coNP, or even to be solvable by subexponential algorithms. Finally, we take the first steps in investigating the fixed-parameter complexity of parity, Rabin, Streett, and Muller games." @default.
- W268115422 created "2016-06-24" @default.
- W268115422 creator A5046999727 @default.
- W268115422 creator A5058270816 @default.
- W268115422 creator A5060945413 @default.
- W268115422 creator A5067152237 @default.
- W268115422 date "2005-01-01" @default.
- W268115422 modified "2023-10-14" @default.
- W268115422 title "The controlled linear programming problem : DIMACS Technical Report 2004-41, September 2004" @default.
- W268115422 hasPublicationYear "2005" @default.
- W268115422 type Work @default.
- W268115422 sameAs 268115422 @default.
- W268115422 citedByCount "0" @default.
- W268115422 crossrefType "journal-article" @default.
- W268115422 hasAuthorship W268115422A5046999727 @default.
- W268115422 hasAuthorship W268115422A5058270816 @default.
- W268115422 hasAuthorship W268115422A5060945413 @default.
- W268115422 hasAuthorship W268115422A5067152237 @default.
- W268115422 hasConcept C11413529 @default.
- W268115422 hasConcept C126255220 @default.
- W268115422 hasConcept C127413603 @default.
- W268115422 hasConcept C132525143 @default.
- W268115422 hasConcept C144237770 @default.
- W268115422 hasConcept C146978453 @default.
- W268115422 hasConcept C22171661 @default.
- W268115422 hasConcept C22590252 @default.
- W268115422 hasConcept C311688 @default.
- W268115422 hasConcept C33923547 @default.
- W268115422 hasConcept C41008148 @default.
- W268115422 hasConcept C41045048 @default.
- W268115422 hasConcept C52692508 @default.
- W268115422 hasConcept C64543145 @default.
- W268115422 hasConcept C80444323 @default.
- W268115422 hasConceptScore W268115422C11413529 @default.
- W268115422 hasConceptScore W268115422C126255220 @default.
- W268115422 hasConceptScore W268115422C127413603 @default.
- W268115422 hasConceptScore W268115422C132525143 @default.
- W268115422 hasConceptScore W268115422C144237770 @default.
- W268115422 hasConceptScore W268115422C146978453 @default.
- W268115422 hasConceptScore W268115422C22171661 @default.
- W268115422 hasConceptScore W268115422C22590252 @default.
- W268115422 hasConceptScore W268115422C311688 @default.
- W268115422 hasConceptScore W268115422C33923547 @default.
- W268115422 hasConceptScore W268115422C41008148 @default.
- W268115422 hasConceptScore W268115422C41045048 @default.
- W268115422 hasConceptScore W268115422C52692508 @default.
- W268115422 hasConceptScore W268115422C64543145 @default.
- W268115422 hasConceptScore W268115422C80444323 @default.
- W268115422 hasLocation W2681154221 @default.
- W268115422 hasOpenAccess W268115422 @default.
- W268115422 hasPrimaryLocation W2681154221 @default.
- W268115422 hasRelatedWork W115934038 @default.
- W268115422 hasRelatedWork W1543756640 @default.
- W268115422 hasRelatedWork W1663331386 @default.
- W268115422 hasRelatedWork W1685014718 @default.
- W268115422 hasRelatedWork W1898131300 @default.
- W268115422 hasRelatedWork W2012023964 @default.
- W268115422 hasRelatedWork W2081063310 @default.
- W268115422 hasRelatedWork W2085537063 @default.
- W268115422 hasRelatedWork W2092164916 @default.
- W268115422 hasRelatedWork W2168360220 @default.
- W268115422 hasRelatedWork W2184756528 @default.
- W268115422 hasRelatedWork W2277469547 @default.
- W268115422 hasRelatedWork W2345361869 @default.
- W268115422 hasRelatedWork W2467498620 @default.
- W268115422 hasRelatedWork W2803455449 @default.
- W268115422 hasRelatedWork W2982620260 @default.
- W268115422 hasRelatedWork W3154344524 @default.
- W268115422 hasRelatedWork W643466127 @default.
- W268115422 hasRelatedWork W85617803 @default.
- W268115422 hasRelatedWork W2189128775 @default.
- W268115422 isParatext "false" @default.
- W268115422 isRetracted "false" @default.
- W268115422 magId "268115422" @default.
- W268115422 workType "article" @default.