Filters








293 Hits in 2.3 sec

MDPs with Energy-Parity Objectives [article]

Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017 arXiv   pre-print
Energy-parity objectives combine ω-regular with quantitative objectives of reward MDPs. The controller needs to avoid to run out of energy while satisfying a parity objective.  ...  time for energy-parity MDPs.  ...  This work was partially supported by the EPSRC through grants EP/M027287/1 and EP/M027651/1 (Energy Efficient Control), and EP/P020909/1 (Solving Parity Games in Theory and Practice).  ... 
arXiv:1701.02546v3 fatcat:ddj2qmikvbawdizanefbpjgof4

MDPs with energy-parity objectives

Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
Energy-parity objectives combine ω-regular with quantitative objectives of reward MDPs. The controller needs to avoid to run out of energy while satisfying a parity objective.  ...  time for energy-parity MDPs.  ...  This work was partially supported by the EPSRC through grants EP/M027287/1 and EP/M027651/1 (Energy Efficient Control), and EP/P020909/1 (Solving Parity Games in Theory and Practice).  ... 
doi:10.1109/lics.2017.8005131 dblp:conf/lics/MayrSTW17 fatcat:2cap4uknx5bdzbeqqe6q6tbcfq

Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives [chapter]

Krishnendu Chatterjee, Laurent Doyen
2012 Lecture Notes in Computer Science  
In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with  ...  parity objectives.  ...  MDPs with mean-payoff parity and energy parity objectives MDPs with mean-payoff parity and energy parity objectives were considered in [6] , and the following results were established.  ... 
doi:10.1007/978-3-642-25929-6_3 fatcat:ehqil7hdpvh7rnfwuliovhaul4

Energy and Mean-Payoff Parity Markov Decision Processes [chapter]

Krishnendu Chatterjee, Laurent Doyen
2011 Lecture Notes in Computer Science  
We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives.  ...  ., winning with probability 1) in energy parity MDPs is in NP ∩ coNP, while for meanpayoff parity MDPs, the problem is solvable in polynomial time.  ...  As a consequence, solving MDP with energy objectives is at least as hard as solving parity games.  ... 
doi:10.1007/978-3-642-22993-0_21 fatcat:vqqlf5mccndlvn4k2rlkms3ptq

Energy and Mean-Payoff Parity Markov Decision Processes [article]

Krishnendu Chatterjee, Laurent Doyen
2011 arXiv   pre-print
We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives.  ...  ., winning with probability 1) in energy parity MDPs is in NP \cap coNP, while for mean-payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound.  ...  MDPs with Energy Parity Objectives We show that energy parity MDPs can be solved in NP ∩ coNP, using a reduction to two-player energy Büchi games.  ... 
arXiv:1104.2909v1 fatcat:4jvzspc6wzhjlmydumvvhj4tsa

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints

Jan Kretínský, Guillermo A. Pérez, Jean-François Raskin, Michael Wagner
2018 International Conference on Concurrency Theory  
We formalize the problem of maximizing the mean-payoff value with high probability while satisfying a parity objective in a Markov decision process (MDP) with unknown probabilistic transition function  ...  (i) For all ε and γ we can construct an online-learning finite-memory strategy that almost-surely satisfies the parity objective and which achieves an ε-optimal mean payoff with probability at least 1  ...  Following this approach, in [1] , Almagor et al. study MDPs equipped with a mean-payoff and parity objective.  ... 
doi:10.4230/lipics.concur.2018.8 dblp:conf/concur/KretinskyPR18 fatcat:j6fszayujnd4rku6wa4o4puux4

Diversifying Risk Parity

Harald Lohre, Heiko Opfer, Gabor Orszag
2012 Social Science Research Network  
Energy Financials Health Care Industrials IT Materials Telecom Utilities Vola by PPs • RP with value and small cap tilt.  ...  highest return and volatility gives lowest SR, MV with reasonable return at lowest volatility gives high SR • RP: Middle-ground between 1/N and MV, MDP still ok • DRP: Highest SR and convincing MDDs!  ... 
doi:10.2139/ssrn.1974446 fatcat:3siwawtob5h7ppvkyazcqsc4tm

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints [article]

Jan Křetínský, Guillermo A. Pérez, Jean-François Raskin
2018 arXiv   pre-print
We formalize the problem of maximizing the mean-payoff value with high probability while satisfying a parity objective in a Markov decision process (MDP) with unknown probabilistic transition function  ...  (i) For all ϵ and γ we can construct an online-learning finite-memory strategy that almost-surely satisfies the parity objective and which achieves an ϵ-optimal mean payoff with probability at least 1  ...  There, they derive robustness bounds for MDPs with the discounted-sum function and use them to obtain robustness bounds for MDPs with a parity objective.  ... 
arXiv:1804.08924v4 fatcat:wdz4hyx7obhxdcep2bbxd2dx6a

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes [article]

Raphaël Berthon and Mickael Randour and Jean-François Raskin
2017 arXiv   pre-print
We build strategies that satisfy a main parity objective on all plays, while ensuring a secondary one with sufficient probability.  ...  Our work extends the framework of [BFRR14] and follow-up papers, which focused on quantitative objectives, by addressing the case of ω-regular conditions encoded as parity objectives, a natural way to  ...  Figure 1 1 An MDP where player 1 can ensure p1 surely and p2 almost-surely. with Guarantees for Parity Objectives in MDPs on A is a function p : A → [0, 1] ∩ Q such that a∈A p(a) = 1.  ... 
arXiv:1702.05472v2 fatcat:ptukr7d7crbw7apxqoq2fboueq

Perfect-Information Stochastic Mean-Payoff Parity Games [chapter]

Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj
2014 Lecture Notes in Computer Science  
We consider 2 1 2 -player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff  ...  Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective  ...  The polynomial time complexity for MDPs with mean-payoff parity objectives was established in [11] and the polynomial time complexity for MDPs with positive average parity objectives was shown in [19  ... 
doi:10.1007/978-3-642-54830-7_14 fatcat:fgzfjysqcbdgvgfglzyw7qkpyu

Probabilistic Model Checking and Non-standard Multi-objective Reasoning [chapter]

Christel Baier, Clemens Dubslaff, Sascha Klüppelholz, Marcus Daum, Joachim Klein, Steffen Märcker, Sascha Wunderlich
2014 Lecture Notes in Computer Science  
, such as energy and utility.  ...  In this paper, we report on the experiences we made in inter-disciplinary research projects where we contribute with formal methods for the analysis of hardware and software systems.  ...  By the results established in [12] for energy games with an MDP game arena, problem (E1) is in NP∩coNP, when ϕ is a reachability, Büchi or parity condition.  ... 
doi:10.1007/978-3-642-54804-8_1 fatcat:csy2e7dzcfhmdhcdykcixfioki

Qualitative Controller Synthesis for Consumption Markov Decision Processes [chapter]

František Blahoudek, Tomáš Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu
2020 Lecture Notes in Computer Science  
We study the complexity of strategy synthesis in consumption MDPs with almost-sure Büchi objectives. We show that the problem can be solved in polynomial time.  ...  In particular, [26] considers controller synthesis for energy MDPs with qualitative Büchi and parity objectives.  ...  Alternatively, consumption MDPs with parity objectives could be reduced to consumption-Büchi MPDs using the standard parity-to-Büchi MDP construction [25, 30, 32, 33] .  ... 
doi:10.1007/978-3-030-53291-8_22 fatcat:c32sewrmirhtvorq47f6g4xopy

Probabilistic Model Checking and Autonomy [article]

Marta Kwiatkowska, Gethin Norman, David Parker
2021 arXiv   pre-print
This includes fully observable and partially observable Markov decision processes, as well as turn-based and concurrent stochastic games, together with associated probabilistic temporal logics.  ...  DISCLOSURE STATEMENT The authors are not aware of any affiliations, memberships, funding, or financial holdings that might be perceived as affecting the objectivity of this review. LITERATURE CITED  ...  Similarly to MDP model checking, when the sub-formulae of path formulae are restricted to propositional formulae (i.e., no LTL), then DPAs are not required and parity winning conditions are replaced with  ... 
arXiv:2111.10630v1 fatcat:ckaniytpargkpcug52qvwgh3iy

Parallel Programming with Matrix Distributed Processing [article]

Massimo Di Pierro
2005 arXiv   pre-print
MDP enables programmers to focus on algorithms, while parallelization is dealt with automatically and transparently.  ...  Matrix Distributed Processing (MDP) is a C++ library for fast development of efficient parallel algorithms. It constitues the core of FermiQCD.  ...  Code download MDP, PSIM and FermiQCD are currently distributed together and can be downloaded from: http://www.fermiqcd.net  ... 
arXiv:hep-lat/0505005v1 fatcat:zs3bum3jaragzcjki4mf4q3fai

Markov Decision Processes to Model Livestock Systems [chapter]

Lars Relund Nielsen, Anders Ringgaard Kristensen
2015 International Series in Operations Research and Management Science  
The objective of this chapter is to review the increasing amount of papers using MDPs to model livestock farming systems and provide an overview over the recent advances within this branch of research.  ...  Moreover, theory and algorithms for solving both ordinary and hierarchical MDPs are given and possible software for solving MDPs are considered. * Preprint of L.R. Nielsen and A.R.  ...  This chapter has been compiled with support from The Danish Council for Strategic Research (The PigIT project, Grant number 11-116191).  ... 
doi:10.1007/978-1-4939-2483-7_19 fatcat:4ezlvzlshbdq3d4mshlj2ltshe
« Previous Showing results 1 — 15 out of 293 results