Filters








711 Hits in 4.5 sec

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited [chapter]

Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels
2011 Lecture Notes in Computer Science  
Along the way, we provide a new study of mean-payoff parity games. In particular, we prove that the opponent player has a memoryless optimal strategy and give a new algorithm for solving these games.  ...  Using a translation into mean-payoff parity games, we prove that the problem of computing (the permissiveness of) a most permissive winning strategy is in NP intersected coNP.  ...  We thank an anonymous reviewer for pointing out the polynomial reduction from mean-penalty parity games to mean-payoff parity games, which has simplified the proof that mean-penalty parity games are in  ... 
doi:10.1007/978-3-642-24372-1_11 fatcat:7gzyq7jle5dftl6cse6ht6rn5q

Average-energy games

Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen
2016 Acta Informatica  
Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy.  ...  We prove that deciding the winner in such games is in NP ∩ coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win.  ...  Mean-payoff games can be reduced to average-energy games in polynomial time.  ... 
doi:10.1007/s00236-016-0274-1 fatcat:tq7gdaqwpvfydklm6xskuuhoqu

Average-energy games

Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen
2015 Electronic Proceedings in Theoretical Computer Science  
Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy.  ...  We prove that deciding the winner in such games is in NP inter coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win.  ...  Mean-payoff games can be reduced to average-energy games in polynomial time.  ... 
doi:10.4204/eptcs.193.1 fatcat:3an6c26mwfguve443ywo3zeeg4

Energy and Mean-Payoff Games with Imperfect Information [chapter]

Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Toruńczyk
2010 Lecture Notes in Computer Science  
In a mean-payoff game, the objective is to optimize the limit-average usage of the resource.  ...  This undecidability result carries over to mean-payoff games with imperfect information.  ...  This result leads to faster pseudo-polynomial time algorithms for solving mean-payoff games [4, 10] .  ... 
doi:10.1007/978-3-642-15205-4_22 fatcat:shur3s2nw5f25pa7dtzv6hzovq

Automated competitive analysis of real-time scheduling with graph games

Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid
2017 Real-time systems  
For the competitive analysis case, given any taskset T and any finite-memory online scheduling algorithm A, we show that the competitive ratio of A in T can be computed in polynomial time in the size of  ...  Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm.  ...  Acknowledgements This work has been supported by the Austrian Science Foundation (FWF) under the NFN RiSE (S11405 and S11407), FWF Grant P23499-N23, ERC Start Grant (279307: Graph Games), and Microsoft  ... 
doi:10.1007/s11241-017-9293-4 fatcat:b5ykzu6dwfaalnu7xpfojg3hn4

Synchronization and Control of Quantitative Systems [article]

Simon Laursen
2016 Ph.d.-serien for Det Teknisk-Naturvidenskabelige Fakultet, Aalborg Universitet  
This challenge creates the need for expressive and computationally feasible modeling and specification formalisms.  ...  In this thesis, we explore modeling formalisms for quantitative systems and systems with partial observability to determine their computational limitations and feasibility.  ...  We thank these institutions for their hospitality, and for the support by the DFG project TriCS (ZI 1516/1-1), the ERC Advanced Grant LASSO and the EU FET projects SENSATION and CASSTING.  ... 
doi:10.5278/vbn.phd.engsci.00182 fatcat:kftiafaw4fhf5lyrvqha7vaoce

Polyhedral value iteration for discounted games and energy games [article]

Alexander Kozachinskiy
2020 arXiv   pre-print
We present a deterministic algorithm, solving discounted games with n nodes in n^O(1)· (2 + √(2))^n-time. For bipartite discounted games our algorithm runs in n^O(1)· 2^n-time.  ...  Our approach is heavily inspired by a recent algorithm of Dorfman et al. (ICALP 2019) for energy games. For completeness, we present their algorithm in terms of polyhedral value iteration.  ...  I am grateful to Pierre Ohlmann for giving a talk about [6] at the University of Warwick, and to Marcin Jurdzinski for discussions.  ... 
arXiv:2007.08575v2 fatcat:fdv66pzkbfhubdi7s34pajb3aq

Average-energy games (full version) [article]

Patricia Bouyer and Nicolas Markey and Mickael Randour and Kim G. Larsen and Simon Laursen
2016 arXiv   pre-print
Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy.  ...  We prove that deciding the winner in such games is in NP ∩ coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win.  ...  Mean-payoff games can be reduced to average-energy games in polynomial time. Proof. Let G = (S 1 , S 2 , E, w) be a game, and t ∈ Q be the threshold for the mean-payoff problem.  ... 
arXiv:1512.08106v3 fatcat:jjdely3guzborij4lp42rkkwra

The Theory of Universal Graphs for Infinite Duration Games [article]

Thomas Colcombet, Nathanaël Fijalkow, Paweł Gawrychowski, Pierre Ohlmann
2021 arXiv   pre-print
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games.  ...  For each of these four cases we construct algorithms achieving or improving over the best known time and space complexity.  ...  for parity and mean payoff games.  ... 
arXiv:2104.05262v4 fatcat:n4xf3gndojg7dcxe63e7m6jluu

Natural games

Jani Anttila, Arto Annila
2011 Physics Letters A  
On the contrary, evolutionary equation for open systems reveals that when there are three or more degrees of freedom for behavior, the course of a game is inherently unpredictable in detail because each  ...  The thermodynamic formalism relates everything in terms of energy and describes various ways to consume free energy.  ...  Acknowledgements We thank Niall Douglas, Vesa Kanniainen, Leena Kekäläinen and Robert Leigh for inspiring comments and valuable corrections.  ... 
doi:10.1016/j.physleta.2011.08.056 fatcat:rlyn7t4wy5et5bb3nqi5mk6bnm

Extinction dynamics from metastable coexistences in an evolutionary game

Hye Jin Park, Arne Traulsen
2017 Physical review. E  
Deterministic evolutionary game dynamics can lead to stable coexistences of different types. Stochasticity, however, drives the loss of such coexistences.  ...  Our results show that more abundant types in a coexistence can be more likely to go extinct first well agreed with previous results, and also the distance between the coexistence and extinction point is  ...  xx→x = 1 aM , λ yy→y = 1 dM , λ xy→x = 1 cM , λ xy→y = 1 bM . (5) arXiv:1710.01339v1 [physics.bio-ph] 3 Oct 2017 The element A ij of the payoff matrix means a payoff of the type i from game interaction  ... 
doi:10.1103/physreve.96.042412 pmid:29347472 fatcat:xsk6pdqhn5ehranvaoh3emok5a

Learning Distributed Power Allocation Policies In Mimo Channels

Elena Veronica Belmega, Mérouane Debbah, Are Hjørungnes, Samson Lasaulce
2010 Zenodo  
In [8] , the authors propose two stochastic learning algorithms that converge to the pure strategy NE and to mixed strategy NE of the energy efficiency game in a single-input single-output (SISO) interference  ...  The mathematical definition of a pure-strategy NE is given by: Definition 1 A strategy profile a * ∈ A is a Nash equilibrium for the game G = (K , {A k } k∈K , {u k } k∈K ) if for all k ∈ K and all a k  ... 
doi:10.5281/zenodo.42258 fatcat:mmcfdzaoyzfgjd6jcoo62guh5m

Adaptive automata model for learning opponent behavior based on genetic algorithms
English

Almanasra Sally, Suwais Khaled, Rafie Arshad Muhammad
2012 Scientific Research and Essays  
The purpose of this research is to study how genetic algorithms (GA's) are applied in the field of Game Theory. GA's are effective approaches for machine learning and optimization problems.  ...  In this work, genetic algorithm is utilized to determine the behavior of an opponent in Prisoners' Dilemma. The opponent behavior will be modeled by means of adaptive automaton.  ...  From the other perspective, genetic algorithms are stochastic search and global minimization technique, for systems with complicated potential energy surface.  ... 
doi:10.5897/sre11.1860 fatcat:yepjouklzbao7jdxwpk6wjw4cy

Payoff distribution in robust coalitional games on time-varying networks [article]

Aitazaz Ali Raja, Sergio Grammatico
2020 arXiv   pre-print
An energy storage optimization application motivates our framework for "robust coalitional games".  ...  Our main contribution is to design two distributed algorithms, namely, distributed payoff allocation and distributed bargaining, that converge to a consensual payoff distribution in the robust CORE.  ...  to propose faster algorithms.  ... 
arXiv:2009.03783v2 fatcat:npnrzvpffvg3znu3g4ch7xzyju

A Game-Theoretic and Experimental Analysis of Energy-Depleting Underwater Jamming Attacks [article]

Alberto Signori, Federico Chiariotti, Filippo Campagnaro, Michele Zorzi
2019 arXiv   pre-print
We model the jammer and the transmitter as players in a multistage game, deriving the optimal strategies.  ...  For example, an attack to a military underwater network for enemy targeting or identification can lead to serious consequences.  ...  We thank Roberto Francescon and Emanuele Coccolo for their practical support and participation in the lake experiment, and Chiara Pielli, Marco Giordani, and Nicola Laurenti for their work on the preliminary  ... 
arXiv:1912.03200v1 fatcat:jfrm3t4xazgh7bl57dtialbn64
« Previous Showing results 1 — 15 out of 711 results