Relevant bibliographies by topics / Parity game

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Parity game'

Author: Grafiati

Published: 25 May 2024

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parity game.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parity game"

Cranen, Sjoerd, Jeroen J. A. Keiren, and Tim A. C. Willemse. "Parity game reductions." Acta Informatica 55, no. 5 (2017): 401–44. http://dx.doi.org/10.1007/s00236-017-0301-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

FRIEDMANN, OLIVER, and MARTIN LANGE. "TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING." International Journal of Foundations of Computer Science 23, no. 03 (2012): 669–85. http://dx.doi.org/10.1142/s0129054112400333.

Full text

Abstract:

The problem of solving a parity game is at the core of many problems in model checking, satisfiability checking and program synthesis. Some of the best algorithms for solving parity game are strategy iteration algorithms. These are global in nature since they require the entire parity game to be present at the beginning. This is a distinct disadvantage because in many applications one only needs to know which winning region a particular node belongs to, and a witnessing winning strategy may cover only a fractional part of the entire game graph. We present two local strategy iteration algorithm

APA, Harvard, Vancouver, ISO, and other styles

Gazda, M. W., and T. A. C. Willemse. "Cooking Your Own Parity Game Preorders Through Matching Plays." International Journal of Foundations of Computer Science 29, no. 04 (2018): 571–90. http://dx.doi.org/10.1142/s012905411841006x.

Full text

Abstract:

Parity games can be used to solve satisfiability, verification and controller synthesis problems. As part of an effort to better understand their nature, or the nature of the problems they solve, preorders on parity games have been studied. Defining these relations, and in particular proving their transitivity, has proven quite difficult on occasion. We propose a uniform way of lifting certain preorders on Kripke structures to parity games and study the resulting preorders. We explore their relation with parity game preorders from the literature and we study new relations. Finally, we investig

APA, Harvard, Vancouver, ISO, and other styles

WANG, CHAO, NENG-GANG XIE, LU WANG, YE YE, and GANG XU. "A PARRONDO'S PARADOX GAME DEPENDING ON CAPITAL PARITY." Fluctuation and Noise Letters 10, no. 02 (2011): 147–56. http://dx.doi.org/10.1142/s0219477511000454.

Full text

Abstract:

Parrondo's Paradox has pointed out that combined losing strategies can win. In Parrondo's Paradox games, the design of game B is critical. Currently there are mainly three versions, which depend on capital, history and space. We devise a new version of game B which depends on the capital parity and draw on the structure of the benefit matrix in the Prisoner's Dilemma game model. Theoretical analysis and computer simulation results both demonstrate the establishment of this paradox version.

APA, Harvard, Vancouver, ISO, and other styles

Friedmann, Oliver, and Martin Lange. "Local Strategy Improvement for Parity Game Solving." Electronic Proceedings in Theoretical Computer Science 25 (June 9, 2010): 118–31. http://dx.doi.org/10.4204/eptcs.25.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

van Dijk, Tom. "A Parity Game Tale of Two Counters." Electronic Proceedings in Theoretical Computer Science 305 (September 18, 2019): 107–22. http://dx.doi.org/10.4204/eptcs.305.8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Ben-Naim, E., and P. L. Krapivsky. "Parity and ruin in a stochastic game." European Physical Journal B 25, no. 2 (2002): 239–43. http://dx.doi.org/10.1140/epjb/e20020027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

MICEK, PIOTR, and BARTOSZ WALCZAK. "A Graph-Grabbing Game." Combinatorics, Probability and Computing 20, no. 4 (2011): 623–29. http://dx.doi.org/10.1017/s0963548311000071.

Full text

Abstract:

Two players share a connected graph with non-negative weights on the vertices. They alternately take the vertices (one in each turn) and collect their weights. The rule they have to obey is that the remaining part of the graph must be connected after each move. We conjecture that the first player can get at least half of the weight of any tree with an even number of vertices. We provide a strategy for the first player to get at least 1/4 of an even tree. Moreover, we confirm the conjecture for subdivided stars. The parity condition is necessary: Alice gets nothing on a three-vertex path with a

APA, Harvard, Vancouver, ISO, and other styles

Sanchez, Lisette, Wieger Wesselink, and Tim A. C. Willemse. "A Comparison of BDD-Based Parity Game Solvers." Electronic Proceedings in Theoretical Computer Science 277 (September 7, 2018): 103–17. http://dx.doi.org/10.4204/eptcs.277.8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Lijzenga, Oebele, and Tom van Dijk. "Symbolic Parity Game Solvers that Yield Winning Strategies." Electronic Proceedings in Theoretical Computer Science 326 (September 20, 2020): 18–32. http://dx.doi.org/10.4204/eptcs.326.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Parity game"

Karelović, Bruno. "Quantitative analysis of stochastic systems : priority games and populations of Markov chains." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCC165/document.

Full text

Abstract:

Cette thèse examine certaines questions quantitatives dans le cadre de deux modèles stochastiques différents. Il est divisé en deux parties : la première partie examine une nouvelle classe de jeux stochastiques avec une fonction de paiement particulière que nous appelons « de priorité ». Cette classe de jeux contient comme sous-classes propre les jeux de parité, largement étudiés en informatique, et les jeux de limsup et liminf, étudiés dans la théorie des jeux. La deuxième partie de la thèse examine certaines questions naturelles mais complexes sur les distributions, étudiées dans le cadre pl

APA, Harvard, Vancouver, ISO, and other styles

Bordais, Benjamin. "Concurrent two-player antagonistic games on graphs." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG072.

Full text

Abstract:

On étudie des jeux à deux joueuses (A et B) sur des graphes. À partir d'un état du graphe, les joueuses interagissent pour aller d'un état à un autre.Ceci induit une suite infinie d'états à laquelle une fonction de gain mesurable associe une valeur dans [0, 1]. La Joueuse A (resp. B) tente de maximiser (resp.minimiser) l'espérance de cette fonction de gain.Les jeux à tours, i.e. les jeux tels qu'à chaque état une seule joueuse choisit(une loi de probabilités sur) l'état suivant, ont de nombreuses bonnes propriétés.Par exemple, dans tous les jeux à tours perd/gagne déterministes, une joueuse a

APA, Harvard, Vancouver, ISO, and other styles

Óbdržálek, Jan. "Algorithmic analysis of parity games." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/25034.

Full text

Abstract:

In this thesis we add to the body of work on parity games. We start by presenting parity games and explaining the concepts behind them, giving a survey of known algorithms, and show their relationship to other problems. In the second part of the thesis we want to answer the following question: Are there classes of graphs on which we can solve parity games in polynomial time? Tree-width has long been considered the most important connectivity measure of (undirected) graphs, and we give a polynomial algorithm for solving parity games on graphs of bounded tree-width. However tree-width is not the

APA, Harvard, Vancouver, ISO, and other styles

Wang, Huaxin. "Solving parity games through fictitious play." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/12554.

Full text

Abstract:

The thesis aims to find an efficient algorithm for solving parity games. Parity games are graph-based, 0-sum, 2-person games with infinite plays. It is known that these games are determined: all nodes in these games are won by exactly one player. Solving parity games is equivalent to the model checking problem of modal mu-calculus; an efficient solution has important implications to program verification and controller synthesis. Although the decision problem of which player wins a given node is generally believed to be in PTIME, all known algorithms so far have been shown to run in (sub)expone

APA, Harvard, Vancouver, ISO, and other styles

Rö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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Kuo, Huan-Pu. "Parity games : descriptive complexity and algorithms for new solvers." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/12175.

Full text

Abstract:

Parity games are 2-person, 0-sum, graph-based, and determined games that form an important foundational concept in formal methods (see e.g., [Zie98]), and their exact computational complexity has been an open problem for over twenty years now. In this thesis, we study algorithms that solve parity games in that they determine which nodes are won by which player, and where such decisions are supported with winning strategies. We modify and so improve a known algorithm but also propose new algorithmic approaches to solving parity games and to understanding their descriptive complexity. For all of

APA, Harvard, Vancouver, ISO, and other styles

Hilaire, Mathieu. "Parity games and reachability in infinite-state systems with parameters." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG095.

Full text

Abstract:

Les approches standard de la vérification de modèle se limitent à des spécifications concrètes, par exemple «est-il possible d'atteindre une configuration après que plus de 10 unités de temps se soient écoulées?». Néanmoins, pour certains types de programmes informatiques, comme les technologies embarquées, les contraintes dépendent de l'environnement. De là émerge la nécessité des spécifications paramétriques, par exemple «est-il possible d'atteindre une configuration après que plus de p unités de temps se soient écoulées?» où p désigne un paramètre dont la valeur reste à spécifier.Dans cette

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

Abstract:

What social practices are people involved when staying in a game café? What kind of social setting is the game café? What are the attitudes towards playing computer games at home and in public among parents? What are the media representations of co-located game playing in public? What are the sensory experiences of playing co-located game play in public? This dissertation gives a descriptive and analytical account of the contexts and meanings of playing co-located computer games in public settings such as game cafés and LAN parties. The overall aim with the dissertation is to describe and inve

APA, Harvard, Vancouver, ISO, and other styles

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chon, ChuYoung. "AN UNINVITED PARTY: POWER, GAZE, AND WEDEKIND’S LULU." Miami University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=miami1070577246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Parity game"

Stratton, Bryan. Mario Party 5: Official Strategy Guide. Prima Games, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Bogenn, Tim. Mario Party 2: Official Strategy Guide. BradyGames, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Cohen, Mark L. The Sims house party expansion pack: Prima's official strategy guide. Prima Games, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Mason, Bernard Sterling. Party games. Perennial Library, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Mason, Bernard Sterling. Party games. Perennial Library, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Development, Prima. Mario Party 2: Prima's Official Strategy Guide. Prima Games, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Hodgson, David S. J. Mario Party 3: Prima's Official Strategy Guide. Prima Games, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Bounford, Trevor. Children's party games. Collins, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Schuette, Sarah L. Birthday party games. Capstone Press, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Schuette, Sarah L. Birthday Party Games. Capstone Press, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Parity game"

Hansen, Helle Hvid, Clemens Kupke, Johannes Marti, and Yde Venema. "Parity Games and Automata for Game Logic." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73579-5_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Laveaux, Maurice, Wieger Wesselink, and Tim A. C. Willemse. "On-The-Fly Solving for Symbolic Parity Games." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_8.

Full text

Abstract:

AbstractParity games can be used to represent many different kinds of decision problems. In practice, tools that use parity games often rely on a specification in a higher-order logic from which the actual game can be obtained by means of an exploration. For many of these decision problems we are only interested in the solution for a designated vertex in the game. We formalise how to use on-the-fly solving techniques during the exploration process, and show that this can help to decide the winner of such a designated vertex in an incomplete game. Furthermore, we define partial solving techniqu

APA, Harvard, Vancouver, ISO, and other styles

Prakash, Aditya. "Checking History-Determinism is NP-hard for Parity Automata." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57228-9_11.

Full text

Abstract:

AbstractWe show that the problem of checking if a given nondeterministic parity automaton simulates another given nondeterministic parity automaton is NP-hard. We then adapt the techniques used for this result to show that the problem of checking history-determinism for a given parity automaton is NP-hard. This is an improvement from Kuperberg and Skrzypczak’s previous lower bound of solving parity games from 2015. We also show that deciding if Eve wins the one-token game or the two-token game of a given parity automaton is NP-hard. Finally, we show that the problem of deciding if the language

APA, Harvard, Vancouver, ISO, and other styles

Hausmann, Daniel, Nir Piterman, Irmak Sağlam, and Anne-Kathrin Schmuck. "Fair $$\omega $$-Regular Games." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57228-9_2.

Full text

Abstract:

AbstractWe consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph $$G=(V,E)$$ G = ( V , E ) and a set of fair moves $$E_f\subseteq E$$ E f ⊆ E a player is said to play fair in G if they choose an edge $$e\in E_f$$ e ∈ E f infinitely often whenever the source node of e is visited infinitely often. Otherwise, they play unfair. We equip such games with two $$\omega $$ ω -regular winning conditions $$\alpha $$ α and $$\beta $$ β deciding the winner of mutually fair and mutually unfair plays, respective

APA, Harvard, Vancouver, ISO, and other styles

Lapauw, Ruben, Maurice Bruynooghe, and Marc Denecker. "Improving Parity Game Solvers with Justifications." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39322-9_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Hausmann, Daniel, and Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.

Full text

Abstract:

AbstractIt is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires $$\mathcal {O}(n^{\frac{k}{2}})$$ O ( n k 2 ) iterations of the function. Calude et al.’s recent quasipolynomial-time parity game solving algorithm essentially shows how to compute the same fixpoint in only quasipolynomially many iterations by reducing parity games to quasipolynomially sized safety games. Universal graphs have been used to modularize this transformation of pari

APA, Harvard, Vancouver, ISO, and other styles

Aggarwal, Saksham, Alejandro Stuckey de la Banda, Luke Yang, and Julian Gutierrez. "A Matrix-Based Approach to Parity Games." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_34.

Full text

Abstract:

AbstractParity games are two-player zero-sum games of infinite duration played on finite graphs for which no solution in polynomial time is still known. Solving a parity game is an $$\text{ NP }\cap \text{ co-NP }$$ NP ∩ co-NP problem, with the best worst-case complexity algorithms available in the literature running in quasi-polynomial time. Given the importance of parity games within automated formal verification, several practical solutions have been explored showing that considerably large parity games can be solved somewhat efficiently. Here, we propose a new approach to solving parity ga

APA, Harvard, Vancouver, ISO, and other styles

Majumdar, Rupak, Irmak Sağlam, and K. S. Thejaswini. "Rabin Games and Colourful Universal Trees." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_11.

Full text

Abstract:

AbstractWe provide an algorithm to solve Rabin and Streett games over graphs with n vertices, m edges, and k colours that runs in $$\tilde{O}\left( mn(k!)^{1+o(1)} \right) $$ O ~ m n ( k ! ) 1 + o ( 1 ) time and $$O(nk\log k \log n)$$ O ( n k log k log n ) space, where $$\tilde{O}$$ O ~ hides poly-logarithmic factors. Our algorithm is an improvement by a super quadratic dependence on k! from the currently best known run time of $$O\left( mn^2(k!)^{2+o(1)}\right) $$ O m n 2 ( k ! ) 2 + o ( 1 ) , obtained by converting a Rabin game into a parity game, while simultaneously improving its exponenti

APA, Harvard, Vancouver, ISO, and other styles

Anand, Ashwani, Satya Prakash Nayak, and Anne-Kathrin Schmuck. "Synthesizing Permissive Winning Strategy Templates for Parity Games." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37706-8_22.

Full text

Abstract:

AbstractWe present a novel method to compute permissive winning strategies in two-player games over finite graphs with $$ \omega $$ ω -regular winning conditions. Given a game graph G and a parity winning condition $$\varPhi $$ Φ , we compute a winning strategy template$$\varPsi $$ Ψ that collects an infinite number of winning strategies for objective $$\varPhi $$ Φ in a concise data structure. We use this new representation of sets of winning strategies to tackle two problems arising from applications of two-player games in the context of cyber-physical system design – (i) incremental synthes

APA, Harvard, Vancouver, ISO, and other styles

Lapauw, Ruben, Maurice Bruynooghe, and Marc Denecker. "Justifications and a Reconstruction of Parity Game Solving Algorithms." In Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-31476-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parity game"

Yin, Xi, Fuxing Li, Zhen Yang, Kaili Zhou, and Linzhi Shan. "Three-party and Multi-Strategy Evolutionary Game in Mobile Crowdsourcing." In 2024 20th International Conference on Mobility, Sensing and Networking (MSN). IEEE, 2024. https://doi.org/10.1109/msn63567.2024.00105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Lee, Samsik, and Hyojin Choi. "Transition of Fertility Practice: Measurement Using Demographic Technique of Parity Progression Ratio." In 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Friedmann, Oliver. "An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it." In 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS). IEEE, 2009. http://dx.doi.org/10.1109/lics.2009.27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Peng, Hui, and Xiao-bing Xu. "The exchange rate theory of network game currency: Based on the parity between input and total output value per unit time." In 2009 International Conference on Management Science and Engineering (ICMSE). IEEE, 2009. http://dx.doi.org/10.1109/icmse.2009.5317976.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Atorf, Daniel, Sergius Dyck, and Ehm Kannegieser. "Integrating System-independent Learning Content with the Benefits of Digital Game Based Learning." In Human Systems Engineering and Design (IHSED 2021) Future Trends and Applications. AHFE International, 2021. http://dx.doi.org/10.54941/ahfe1001150.

Full text

Abstract:

Serious games following the ideas of Digital Game Based Learning by Marc Prensky mainly focus on designing a learning system which feels like a real game while also teaching learning objectives. These games utilize intrinsic motivation, influencing learning effects positively. Previous studies and evaluations identified a demand for a more modular and streamlined framework. Such a framework should provide independence between knowledge domain (mainly content for learning objectives) and the game itself (mainly game mechanics and game loop). Implementing standards will enable incorporating mult

APA, Harvard, Vancouver, ISO, and other styles

Moubayed, Samer Al, Jens Edlund, and Joakim Gustafson. "Analysis of gaze and speech patterns in three-party quiz game interaction." In Interspeech 2013. ISCA, 2013. http://dx.doi.org/10.21437/interspeech.2013-302.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Vester, Steen. "Winning Cores in Parity Games." In LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2016. http://dx.doi.org/10.1145/2933575.2933589.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Wysocki, Piper, Stefan Seritan, and Kenneth Rudinger. "Parity Measurement Gate Set Tomography." In American Physical Society March Meeting - Minneapolis, Minnesota, United States of America - March - 2024. US DOE, 2024. https://doi.org/10.2172/2564035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Berkling, Kay, Mehmet Ali Incekara, and Tom Wolske. "NO-RPG, a game interface to common core sequenced third-party educational games." In 2018 IEEE Global Engineering Education Conference (EDUCON). IEEE, 2018. http://dx.doi.org/10.1109/educon.2018.8363414.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Shankaran, Sriram, and Tom Vandeputte. "Game-Theoretic Models for Cooperative Equilibrium Solutions of Interacting Engineering Sub-Systems." In ASME Turbo Expo 2014: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-25293.

Full text

Abstract:

Although game-theoretical models to study social and economic problems have existed for a long time, they have been sparsely used for the design of engineering systems. This is due to the significant theoretical hurdles posed by game formulations for real engineering environments /problems. In this study we show our first attempt at adapting the frame-work of game-theoretical models for engineering problems, in particular the aero-mechanical optimization of a notional turbine blade. We pose the design problem as a series of games, starting with the determination of the Pareto front, the non-co

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "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), 2023. http://dx.doi.org/10.55271/rp0037.

Full text

Abstract:

My Memory of Us is a narrative-driven puzzle-adventure video game developed by Juggler Games. The game is set in a fictional version of Poland during World War II and tells the story of a young boy and girl who must navigate through a city that has been divided into two parts: one for Jews and one for non-Jews. The game features hand-drawn art, puzzle-solving, and stealth elements, as well as a unique memory-manipulation mechanic that allows players to change the past to solve puzzles and progress through the story. The game received positive reviews for its story and art. Overall, My Memory o

APA, Harvard, Vancouver, ISO, and other styles

Gonchigdorj, Ariunkhishig, Frederika Warren, Akanksha Bapna, Namrata Sharma, Arnaldo Pellini, and Crystal Green. Spotlight on EdTech: Bangladesh. HundrED, 2023. http://dx.doi.org/10.58261/misf7076.

Full text

Abstract:

Bangladesh has made remarkable progress in achieving over 90% primary enrollment with significantly improved gender parity. Its focus has now shifted from universal primary education towards the quality of education and improvements in teaching outcomes. In order to meet this goal, the government has turned to the merits that EdTech can offer and is implementing a blended learning approach that integrates both digital and physical elements, and balances creative and logical aspects to strengthen its progress and address Bangladesh’s current educational challenges. In partnership with EdTech Hu

APA, Harvard, Vancouver, ISO, and other styles

Chatterjee, Krishnendu, and Thomas A. Henzinger. Algorithms for Stochastic Parity Games. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada603293.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chatterjee, Krishnendu, Luca de Alfaro, and Thomas A. Henzinger. The Complexity of Quantitative Concurrent Parity Games. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada603313.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Tokarieva, Anastasiia V., Nataliia P. Volkova, Inesa V. Harkusha, and Vladimir N. Soloviev. Educational digital games: models and implementation. [б. в.], 2019. http://dx.doi.org/10.31812/123456789/3242.

Full text

Abstract:

Nowadays, social media, ICT, mobile technologies and applications are increasingly used as tools for communication, interaction, building up social skills and unique learning environments. One of the latest trends observed in education is an attempt to streamline the learning process by applying educational digital games. Despite numerous research data, that confirms the positive effects of digital games, their integration into formal educational contexts is still relatively low. The purpose of this article is to analyze, discuss and conclude what is necessary to start using games as an instru

APA, Harvard, Vancouver, ISO, and other styles

Grometstein, Alan A. Colonel Richard's Game. Part 1. Elementary Version. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada178384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Williams, Thomas. Cell Biology Board Game: Cell Survival Drive. University of Dundee, 2023. http://dx.doi.org/10.20933/100001276.

Full text

Abstract:

When dangers strike a cell, they are detected by sensors. Sensors tell messengers about the danger. Messengers tell the organiser. The organiser plans the cell defence, using responders and recyclers. Researchers in the MRC-PPU are figuring out how these different parts interact with each other.

APA, Harvard, Vancouver, ISO, and other styles

Galland, Martin. COMTOG Report on ‘Bury Me My Love’. European Center for Populism Studies (ECPS), 2023. http://dx.doi.org/10.55271/rp0036.

Full text

Abstract:

Bury Me My Love is a game about distance. It is a game which places front and center relationships between humans, how they interact, and what drives people to take a leap into the unknown and risk their lives in the hope of reaching safety. The eponymous phrase, ‘Bury Me My Love,’ is an Arabic expression to take care roughly meant to signify, “don’t think about dying before I do.” The game is inspired by but does not tell, the real-life story of Dana, a Syrian woman having left her country in September 2015. Both the journalist who wrote the article on Dana’s story and Dana herself working as

APA, Harvard, Vancouver, ISO, and other styles

Rodríguez Chatruc, Marisol, and Sandra V. Rozo. How Does it Feel to Be Part of the Minority?: Impacts of Perspective Taking on Prosocial Behavio. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003612.

Full text

Abstract:

Can online experiences that illustrate the lives of vulnerable populations improve prosocial behaviors and reduce prejudice? We randomly assign 850 individuals to: i) an online game that immerses individuals in the life decisions of a Venezuelan migrant and ii) a documentary about the migration process of Venezuelans to Colombia. Both treatments effectively improve altruism and reduce prejudice towards migrants. The impacts of both treatments are not statistically different in any of the other outcomes that we examine. The effects of the game are mainly driven by changes in perspective-taking

APA, Harvard, Vancouver, ISO, and other styles

Martinho, Diogo, Adam Field, and Hugo Sarmento. Soccer referees are also part of the game: a systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, 2022. http://dx.doi.org/10.37766/inplasy2022.8.0052.

Full text

Abstract:

Review question / Objective: The of this study was to review and organise the literature using a holistic approach about match indicators, testing, nutrition and physiology on soccer refereeing. Condition being studied: This review is focused on physical, physiological, body composition, and physiological outputs among soccer referees. Each main topic will be organized according to the results of extracted studies. Eligibility criteria: (1) population – male and/or female soccer referees and/or assistant referees; (2) relevant data about body size, body composition, physical performance, physi

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!