Gotowa bibliografia na temat „Parity game”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Parity game”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Parity game"
Cranen, Sjoerd, Jeroen J. A. Keiren i Tim A. C. Willemse. "Parity game reductions". Acta Informatica 55, nr 5 (4.08.2017): 401–44. http://dx.doi.org/10.1007/s00236-017-0301-x.
Pełny tekst źródłaFRIEDMANN, OLIVER, i MARTIN LANGE. "TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING". International Journal of Foundations of Computer Science 23, nr 03 (kwiecień 2012): 669–85. http://dx.doi.org/10.1142/s0129054112400333.
Pełny tekst źródłaGazda, M. W., i T. A. C. Willemse. "Cooking Your Own Parity Game Preorders Through Matching Plays". International Journal of Foundations of Computer Science 29, nr 04 (czerwiec 2018): 571–90. http://dx.doi.org/10.1142/s012905411841006x.
Pełny tekst źródłaWANG, CHAO, NENG-GANG XIE, LU WANG, YE YE i GANG XU. "A PARRONDO'S PARADOX GAME DEPENDING ON CAPITAL PARITY". Fluctuation and Noise Letters 10, nr 02 (czerwiec 2011): 147–56. http://dx.doi.org/10.1142/s0219477511000454.
Pełny tekst źródłaBrütsch, Benedikt, i Wolfgang Thomas. "Solving Infinite Games in the Baire Space". Fundamenta Informaticae 186, nr 1-4 (30.08.2022): 63–88. http://dx.doi.org/10.3233/fi-222119.
Pełny tekst źródłaFEARNLEY, JOHN, i MARTIN ZIMMERMANN. "PLAYING MULLER GAMES IN A HURRY". International Journal of Foundations of Computer Science 23, nr 03 (kwiecień 2012): 649–68. http://dx.doi.org/10.1142/s0129054112400321.
Pełny tekst źródłaFriedmann, Oliver, i Martin Lange. "Local Strategy Improvement for Parity Game Solving". Electronic Proceedings in Theoretical Computer Science 25 (9.06.2010): 118–31. http://dx.doi.org/10.4204/eptcs.25.13.
Pełny tekst źródłavan Dijk, Tom. "A Parity Game Tale of Two Counters". Electronic Proceedings in Theoretical Computer Science 305 (18.09.2019): 107–22. http://dx.doi.org/10.4204/eptcs.305.8.
Pełny tekst źródłaBen-Naim, E., i P. L. Krapivsky. "Parity and ruin in a stochastic game". European Physical Journal B 25, nr 2 (luty 2002): 239–43. http://dx.doi.org/10.1140/epjb/e20020027.
Pełny tekst źródłaSato, Hiroko, i Toshiyuki Yasui. "Differences in Changes in Game Usage Time and Game Use-Related Factors Depending on Parity in a Prospective Study of Pregnant Women in Japan". Healthcare 11, nr 23 (22.11.2023): 3017. http://dx.doi.org/10.3390/healthcare11233017.
Pełny tekst źródłaRozprawy doktorskie na temat "Parity game"
Karelović, Bruno. "Quantitative analysis of stochastic systems : priority games and populations of Markov chains". Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCC165/document.
Pełny tekst źródłaThis thesis examines some quantitative questions in the framework of two different stochastic models. It is divided into two parts: the first part examines a new class of stochastic games with priority payoff. This class of games contains as proper subclasses the parity games extensively studied in computer science, and limsup and liminf games studied in game theory. The second part of the thesis examines some natural but involved questions about distributions, studied in the simple framework of finite state Markov chain.In the first part, we examine two-player zero-sum games focusing on a particular payoff function that we call the priority payoff. This payoff function generalizes the payoff used in parity games. We consider both turn-based stochastic priority games and concurrent priority games. Our approach to priority games is based on the concept of the nearest fixed point of monotone nonexpansive mappings and extends the mu-calculus approach to priority games.The second part of the thesis deals with population questions. Roughly speaking, we examine how a probability distribution over states evolves in time. More specifically, we are interested in questions like the following one: from an initial distribution, can the population reach at some moment a distribution with a probability mass exceeding a given threshold in state Goal? It turns out that this type of questions is much more difficult to handle than the questions concerning individual trajectories: it is not known for the simple model of Markov chains whether population questions are decidable. We study restrictions of Markov chains ensuring decidability of population questions
Bordais, Benjamin. "Concurrent two-player antagonistic games on graphs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG072.
Pełny tekst źródłaWe study games played by two players, Player A and Player B, on a graph. Starting from a state of the graph, the players interact to move from state to state. This induces an infinite sequence of states, which is mapped to a value in [0, 1] by a measurable payoff function. Player A (resp. B) tries to maximize (resp. minimize) the expected value of this payoff function.Turn-based games, i.e. games where at each state only one player chooses a (probability distribution over) successor state, enjoy many nice properties.For instance, in all deterministic win/lose turn-based games, from each state,one of the players has a winning strategy. In addition, in finite turn-based parity games, both players have positional optimal strategies from each state.By contrast, concurrent games, i.e. games where at each state both players interact concurrently, i.e. simultaneously, to generate a probability distributionover successor states, behave much more poorly. Indeed, there are very simple deterministic concurrent parity games such that: neither player has a winning strategy; neither player has an optimal strategy, even a stochastic one. Inaddition, when optimal strategies do exist, they may require infinite memory. The goal of this dissertation is to give significant insight on how concurrent games behave. To do so, we study the notion of game form. Game forms arethe mathematical objects that describe the (local) interactions of the players at each state of a concurrent game. Game forms are defined by a set of local strategies per player, a set of outcomes and a function mapping a pair of one local strategy per player to a probability distribution over outcomes. Generally,in the literature on concurrent games, local interactions are standard (finite)game forms: the sets of local strategies are distributions over underlying (finite) sets of actions. In this dissertation, we define and study more general gameforms, which we call arbitrary game forms. Some of the results we prove hold even with arbitrary local interactions, the others use a standard assumption onthe local interactions involved.First, we prove general results on concurrent games, with very few assumptions on the payoff functions and local interactions involved. In particular, we consider a crucial result on concurrent games: Martin's result on Blackwell determinacy, which can be stated as follows. Consider a concurrent game whereall local interactions are standard finite. From each state, there is a value u in[0, 1] such that Player A's (resp. B's) strategies can guarantee that the expected value of the measurable payoff function is above (resp. below) any threshold below (resp. above) u. We generalize this result to games with arbitrary gameforms. We deduce from this generalization other results on concurrent games,possibly using standard local interactions, which could not have been obtained directly from the original result by Martin. We also prove other results on concurrent games, in particular results related to subgame optimal strategies.Second, we study how finite-state concurrent parity games behave in termsof existence and nature of (almost and/or subgame) optimal strategies, with very few assumptions on the local interactions involved.Third, we define subsets of concurrent games that enjoy some of the nice properties of turn-based games while being more general than turn-based games.These subsets are constructed via local-global transfers, which is a novel approach. Specifically, given a desirable property on concurrent games, we first characterize the game forms that ensure that all simple games using them aslocal interactions satisfy this property. Thus, we characterize the game formsthat behave well individually. We then show that all concurrent games that use these game forms as local interactions also satisfy this property. Thus, we show that these game forms also behave well collectively, hence globally
Óbdržálek, Jan. "Algorithmic analysis of parity games". Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/25034.
Pełny tekst źródłaWang, Huaxin. "Solving parity games through fictitious play". Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/12554.
Pełny tekst źródłaRösner, Clemens [Verfasser]. "Constrained Clustering Problems and Parity Games / Clemens Rösner". Bonn : Universitäts- und Landesbibliothek Bonn, 2019. http://d-nb.info/1200020146/34.
Pełny tekst źródłaKuo, Huan-Pu. "Parity games : descriptive complexity and algorithms for new solvers". Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/12175.
Pełny tekst źródłaHilaire, Mathieu. "Parity games and reachability in infinite-state systems with parameters". Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG095.
Pełny tekst źródłaThe most standard model checking approaches are limited to verifying concrete specifications, such as “can we reach a configuration with more than 10 time units elapsing ?”. Nethertheless, for certaincomputer programs, like embedded systems, the constraints depend on the environment. Thus arisesthe need for parametric specifications, such as “can we reach a configuration with more than p timeunits elapsing ?” where p is a parameter which takes values in the non-negative integers.In this thesis, we study parametric pushdown, counter and timed automata and extensions the-reof. In addition to expressing concrete constraints (on the stack, on the counter or on clocks), thesecan employ parametric constraints. The reachability problem for a parametric automaton asks for the existence of an assignment of the parameters such that there exists an accepting run in the underlying concrete automaton. In addition to the reachability problem, we consider parametric parity games, two player games where players alternate chosing assignments for each parameters, then alternate moving a token along the configurations of the concrete automaton resulting from their choice of parameter assignment. We consider the problem of deciding which player has a winning strategy.Parametric timed automata (PTA for short) were introduced in the 90s by Alur, Henzinger andVardi, who showed that the reachability problem for PTA was undecidable, already when only threeclocks can be compared against parameters, and decidable in the case only one clock can. We callsuch clocks that can be compared to parameters parametric clocks. A few years ago, Bundala andOuaknine proved that, for parametric timed automata with two parametric clocks and one parame-ter ((2, 1)-PTA for short), the reachability problem is decidable and also provided a PSPACENEXP lower bound. One of the main results of this thesis states that reachability for (2, 1)-PTA is in factEXPSPACE-complete. For the EXPSPACE lower bound, inspired by previous work by Göller, Haase, Ouaknine, and Worrell, we rely on a serializability characterization of EXPSPACE (in turn originally based on Barrington's Theorem). We provide a programming language and we show it can simulate serializability computations. Relying on a logspace translation of numbers in Chinese Remainder Representation to binary representation due to Chiu, Davida, and Litow, we then show that small (2, 1)-PTA can simulate our programming language. For the EXPSPACE upper bound on (2, 1)-PTA, we first give a careful exponential time reduction towards a variant of parametric one-counter automata over one parameter based on a minor adjustment of a construction due to Bundala and Ouaknine. We solve the reachability problem for this parametric one-counter automata with one parameter variant, by providing a series of techniques to partition a fictitious run into several carefully chosen subruns. This allows us to prove that it is sufficient to consider a parameter value of exponential magnitude only, which in turn leads to a doubly-exponential upper bound on the value of the only parameter of the (2, 1)-PTA. We hope that extensions of our techniques lead to finally establishing decidability of the long-standing open problem of reachability in PTA with two parametric clocks and arbitrarily many parameters.Concerning parametric pushdown automata, our main result states that deciding the winner ofa parametric parity game is in (n + 1)-EXP in the case the number of parameters n is fixed, but nonelementary otherwise. We provide the nonelementary lower bound via a reduction of the FO satisfiability problem on words. For the upper bound, we reduce parametric pushdown parity games to higher-order pushdown automata parity games, which are known to be n-EXP complete in the case of stacks of level n
Jonsson, Fatima. "Hanging out in the game café : Contextualising co-located computer game play practices and experiences". Doctoral thesis, Stockholms universitet, Institutionen för data- och systemvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-75793.
Pełny tekst źródłaAt the time of the doctoral defense, the following paper was unpublished and had a status as follows: Paper 4: Submitted.
Chon, ChuYoung. "An uninvited party power, gaze, and Wedekind's Lulu /". Oxford, Ohio : Miami University, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=miami1070577246.
Pełny tekst źródłaChon, ChuYoung. "AN UNINVITED PARTY: POWER, GAZE, AND WEDEKIND’S LULU". Miami University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=miami1070577246.
Pełny tekst źródłaKsiążki na temat "Parity game"
The party game. New York: W.H. Freeman, 1985.
Znajdź pełny tekst źródłaStratton, Bryan. Mario Party 5: Official Strategy Guide. Roseville, CA: Prima Games, 2003.
Znajdź pełny tekst źródłaBogenn, Tim. Mario Party 2: Official Strategy Guide. Indianapolis, IN: BradyGames, 2000.
Znajdź pełny tekst źródłaCohen, Mark L. The Sims house party expansion pack: Prima's official strategy guide. Roseville, CA: Prima Games, 2001.
Znajdź pełny tekst źródłaMason, Bernard Sterling. Party games. New York: Perennial Library, 1986.
Znajdź pełny tekst źródłaParty games. Glasgow: HarperCollins, 1994.
Znajdź pełny tekst źródłaParty games. Mankato, Minn: QEB Pub., 2010.
Znajdź pełny tekst źródłaMason, Bernard Sterling. Party games. New York: Perennial Library, 1986.
Znajdź pełny tekst źródłaDevelopment, Prima. Mario Party 2: Prima's Official Strategy Guide. Rocklin, CA: Prima Games, 2000.
Znajdź pełny tekst źródłaBounford, Trevor. Children's party games. London: Collins, 2007.
Znajdź pełny tekst źródłaCzęści książek na temat "Parity game"
Hansen, Helle Hvid, Clemens Kupke, Johannes Marti i Yde Venema. "Parity Games and Automata for Game Logic". W Lecture Notes in Computer Science, 115–32. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73579-5_8.
Pełny tekst źródłaLaveaux, Maurice, Wieger Wesselink i Tim A. C. Willemse. "On-The-Fly Solving for Symbolic Parity Games". W Tools and Algorithms for the Construction and Analysis of Systems, 137–55. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_8.
Pełny tekst źródłaPrakash, Aditya. "Checking History-Determinism is NP-hard for Parity Automata". W Lecture Notes in Computer Science, 212–33. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57228-9_11.
Pełny tekst źródłaHausmann, Daniel, Nir Piterman, Irmak Sağlam i Anne-Kathrin Schmuck. "Fair $$\omega $$-Regular Games". W Lecture Notes in Computer Science, 13–33. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57228-9_2.
Pełny tekst źródłaLapauw, Ruben, Maurice Bruynooghe i Marc Denecker. "Improving Parity Game Solvers with Justifications". W Lecture Notes in Computer Science, 449–70. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39322-9_21.
Pełny tekst źródłaHausmann, Daniel, i Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints". W Tools and Algorithms for the Construction and Analysis of Systems, 38–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.
Pełny tekst źródłaAggarwal, Saksham, Alejandro Stuckey de la Banda, Luke Yang i Julian Gutierrez. "A Matrix-Based Approach to Parity Games". W Tools and Algorithms for the Construction and Analysis of Systems, 666–83. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_34.
Pełny tekst źródłaMajumdar, Rupak, Irmak Sağlam i K. S. Thejaswini. "Rabin Games and Colourful Universal Trees". W Tools and Algorithms for the Construction and Analysis of Systems, 213–31. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_11.
Pełny tekst źródłaLapauw, Ruben, Maurice Bruynooghe i Marc Denecker. "Justifications and a Reconstruction of Parity Game Solving Algorithms". W Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems, 170–87. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-31476-6_9.
Pełny tekst źródłaAnand, Ashwani, Satya Prakash Nayak i Anne-Kathrin Schmuck. "Synthesizing Permissive Winning Strategy Templates for Parity Games". W Computer Aided Verification, 436–58. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37706-8_22.
Pełny tekst źródłaStreszczenia konferencji na temat "Parity game"
Lee, Samsik, i Hyojin Choi. "Transition of Fertility Practice: Measurement Using Demographic Technique of Parity Progression Ratio". W Art, Culture, Game, Graphics, Broadcasting and Digital Contents 2015. Science & Engineering Research Support soCiety, 2015. http://dx.doi.org/10.14257/astl.2015.101.22.
Pełny tekst źródłaFriedmann, Oliver. "An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it". W 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS). IEEE, 2009. http://dx.doi.org/10.1109/lics.2009.27.
Pełny tekst źródłaPeng, Hui, i Xiao-bing Xu. "The exchange rate theory of network game currency: Based on the parity between input and total output value per unit time". W 2009 International Conference on Management Science and Engineering (ICMSE). IEEE, 2009. http://dx.doi.org/10.1109/icmse.2009.5317976.
Pełny tekst źródłaAtorf, Daniel, Sergius Dyck i Ehm Kannegieser. "Integrating System-independent Learning Content with the Benefits of Digital Game Based Learning". W Human Systems Engineering and Design (IHSED 2021) Future Trends and Applications. AHFE International, 2021. http://dx.doi.org/10.54941/ahfe1001150.
Pełny tekst źródłaMoubayed, Samer Al, Jens Edlund i Joakim Gustafson. "Analysis of gaze and speech patterns in three-party quiz game interaction". W Interspeech 2013. ISCA: ISCA, 2013. http://dx.doi.org/10.21437/interspeech.2013-302.
Pełny tekst źródłaParreiras, Marcus, Geraldo Xexéo i Pedro Marques. "Proposta e Estudo de Caso de um Método para Design de Vídeo Games Educacionais". W Anais Estendidos do Simpósio Brasileiro de Jogos e Entretenimento Digital. Sociedade Brasileira de Computação, 2022. http://dx.doi.org/10.5753/sbgames_estendido.2022.226084.
Pełny tekst źródłaVester, Steen. "Winning Cores in Parity Games". W LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933575.2933589.
Pełny tekst źródłaBerkling, Kay, Mehmet Ali Incekara i Tom Wolske. "NO-RPG, a game interface to common core sequenced third-party educational games". W 2018 IEEE Global Engineering Education Conference (EDUCON). IEEE, 2018. http://dx.doi.org/10.1109/educon.2018.8363414.
Pełny tekst źródłaShankaran, Sriram, i Tom Vandeputte. "Game-Theoretic Models for Cooperative Equilibrium Solutions of Interacting Engineering Sub-Systems". W ASME Turbo Expo 2014: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-25293.
Pełny tekst źródłaNain, Sumit, i Moshe Y. Vardi. "Solving Partial-Information Stochastic Parity Games". W 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.40.
Pełny tekst źródłaRaporty organizacyjne na temat "Parity game"
Fernández, Iván Escobar. COMTOG Report: ‘My Memory of Us’ — Boosting Historical Memory Through Implicit Visual Metaphors. European Center for Populism Studies (ECPS), kwiecień 2023. http://dx.doi.org/10.55271/rp0037.
Pełny tekst źródłaGonchigdorj, Ariunkhishig, Frederika Warren, Akanksha Bapna, Namrata Sharma, Arnaldo Pellini i Crystal Green. Spotlight on EdTech: Bangladesh. HundrED, listopad 2023. http://dx.doi.org/10.58261/misf7076.
Pełny tekst źródłaChatterjee, Krishnendu, i Thomas A. Henzinger. Algorithms for Stochastic Parity Games. Fort Belvoir, VA: Defense Technical Information Center, maj 2005. http://dx.doi.org/10.21236/ada603293.
Pełny tekst źródłaChatterjee, Krishnendu, Luca de Alfaro i Thomas A. Henzinger. The Complexity of Quantitative Concurrent Parity Games. Fort Belvoir, VA: Defense Technical Information Center, listopad 2004. http://dx.doi.org/10.21236/ada603313.
Pełny tekst źródłaTokarieva, Anastasiia V., Nataliia P. Volkova, Inesa V. Harkusha i Vladimir N. Soloviev. Educational digital games: models and implementation. [б. в.], wrzesień 2019. http://dx.doi.org/10.31812/123456789/3242.
Pełny tekst źródłaGrometstein, Alan A. Colonel Richard's Game. Part 1. Elementary Version. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1987. http://dx.doi.org/10.21236/ada178384.
Pełny tekst źródłaWilliams, Thomas. Cell Biology Board Game: Cell Survival Drive. University of Dundee, 2023. http://dx.doi.org/10.20933/100001276.
Pełny tekst źródłaGalland, Martin. COMTOG Report on ‘Bury Me My Love’. European Center for Populism Studies (ECPS), kwiecień 2023. http://dx.doi.org/10.55271/rp0036.
Pełny tekst źródłaMartinho, Diogo, Adam Field i Hugo Sarmento. Soccer referees are also part of the game: a systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, sierpień 2022. http://dx.doi.org/10.37766/inplasy2022.8.0052.
Pełny tekst źródłaRodríguez Chatruc, Marisol, i Sandra V. Rozo. How Does it Feel to Be Part of the Minority?: Impacts of Perspective Taking on Prosocial Behavio. Inter-American Development Bank, wrzesień 2021. http://dx.doi.org/10.18235/0003612.
Pełny tekst źródła