Índice
Literatura académica sobre el tema "Blackwell determinacy"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Blackwell determinacy".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Blackwell determinacy"
Martin, Donald A. "The determinacy of Blackwell games". Journal of Symbolic Logic 63, n.º 4 (diciembre de 1998): 1565–81. http://dx.doi.org/10.2307/2586667.
Texto completoMartin, Donald A., Itay Neeman y Marco Vervoort. "The Strength of Blackwell determinacy". Journal of Symbolic Logic 68, n.º 2 (junio de 2003): 615–36. http://dx.doi.org/10.2178/jsl/1052669067.
Texto completoIkegami, Daisuke, David de Kloet y Benedikt Löwe. "The axiom of real Blackwell determinacy". Archive for Mathematical Logic 51, n.º 7-8 (21 de junio de 2012): 671–85. http://dx.doi.org/10.1007/s00153-012-0291-x.
Texto completoLöwe, Benedikt. "Consequences of the Axiom of Blackwell Determinacy". Irish Mathematical Society Bulletin 0049 (2002): 43–70. http://dx.doi.org/10.33232/bims.0049.43.70.
Texto completoLöwe, Benedikt. "A parametrised choice principle and Martin's conjecture on Blackwell determinacy". MLQ 52, n.º 2 (marzo de 2006): 187–89. http://dx.doi.org/10.1002/malq.200410059.
Texto completoLöwe, Benedikt. "The simulation technique and its applications to infinitary combinatorics under the axiom of Blackwell determinacy". Pacific Journal of Mathematics 214, n.º 2 (1 de abril de 2004): 335–58. http://dx.doi.org/10.2140/pjm.2004.214.335.
Texto completoYu, Li y Lewis Markoff. "The Topology of Bulges in the Long Stem of the Flavivirus 3′ Stem-Loop Is a Major Determinant of RNA Replication Competence". Journal of Virology 79, n.º 4 (15 de febrero de 2005): 2309–24. http://dx.doi.org/10.1128/jvi.79.4.2309-2324.2005.
Texto completoBorysova, O. V. "Algal cultures as a model object of studding algal-bacterial communities (consortia)". Algologia 32, n.º 2 (junio de 2022): 167–83. http://dx.doi.org/10.15407/alg32.02.167.
Texto completoFlesch, János y Eilon Solan. "Stochastic Games with General Payoff Functions". Mathematics of Operations Research, 16 de agosto de 2023. http://dx.doi.org/10.1287/moor.2023.1385.
Texto completoGouveia, Leandro Augusto, Marlusa Gosling, Mariana de Freitas Coelho y Gisele de Araujo Pereira. "Fatores que influenciam a intenção de compra de viagens de ecoturismo e turismo de aventura". Revista Brasileira de Ecoturismo (RBEcotur) 7, n.º 3 (27 de agosto de 2014). http://dx.doi.org/10.34024/rbecotur.2014.v7.6405.
Texto completoTesis sobre el tema "Blackwell determinacy"
Bordais, Benjamin. "Concurrent two-player antagonistic games on graphs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG072.
Texto completoWe 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