Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "non-cooperative games" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Cooperative and Non-cooperative, Integrative and Distributive Market Games with Antagonistic and Altruistic, Malicious and Kind Ways of Playing
    Autorzy:
    Laskowski, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/307960.pdf
    Data publikacji:
    2008
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    antagonism and altruism
    competition
    cooperative games
    integrative and distributive processes
    non-cooperative games
    Opis:
    The article illustrates distinctions between important concepts of game theory, which support understanding the relation between subjects on competitive and regulated telecommunications services market. Especially it shows that often used distinction between retail and wholesale market that treat them respectively as competitive and cooperative can be misleading or even wrong.
    Źródło:
    Journal of Telecommunications and Information Technology; 2008, 4; 87-96
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Schelling games, Kuran dominos and electoral coalitions. Non-standard game-theoretic models of collective action
    Autorzy:
    Kaminski, Marek
    Powiązania:
    https://bibliotekanauki.pl/articles/1198726.pdf
    Data publikacji:
    2015
    Wydawca:
    Akademia Leona Koźmińskiego w Warszawie
    Tematy:
    collective action
    non-cooperative games
    partition function
    Schelling’s games
    Kuran’s games
    Mancur Olson
    Opis:
    Non-cooperative games such as the Prisoner’s Dilemma, Stag Hunt, Asymmetric Coordination and others are primary tools used for modeling collective action. I consider formal models that are close cousins of such standard games: Schelling’s games, Kuran’s dominos and partition function form games. For certain empirical problems, each of these formalisms may have advantages over standard games. Among the benefi ts there are mathematical simplicity, more intuitive depiction of represented phenomena, and better operationalizability. I formalize all three models and prove simple existence theorems for two of them. The detailed examples of applications include vaccination, unpredictability of revolutions, and electoral coalitions.
    Źródło:
    Decyzje; 2015, 24; 91-105
    1733-0092
    2391-761X
    Pojawia się w:
    Decyzje
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids
    Autorzy:
    Kołodziej, J.
    Xhafa, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/907798.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    przetwarzanie siatkowe
    szeregowanie
    bezpieczeństwo
    computational grids
    scheduling
    non-cooperative games
    user behavior
    security
    meta-heuristics
    Opis:
    Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 243-257
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    From optimal control to non-cooperative differential games: a homotopy approach
    Autorzy:
    Bressan, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970911.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optimal control
    non-cooperative differential games
    Nash equilibrium solution
    optimal feedback control
    Opis:
    We propose a new approach to the study of Nash equilibrium solutions to non-cooperative differential games. The original problem is embedded in a one-parameter family of differential games, where the parameter 0 ∈ [0,1] accounts for the strength of the second player. When 0 = 0, the second player adopts a myopic strategy and the game reduces to an optimal control problem for the first player. As 0 becomes strictly positive, Nash equilibrium solutions can be obtained by studying a bifurcation problem for the corresponding system of Hamilton-Jacobi equations.
    Źródło:
    Control and Cybernetics; 2009, 38, 4A; 1081-1106
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Non-cooperative game approach to multi-robot planning
    Autorzy:
    Gałuszka, A.
    Świerniak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/908521.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    zagadnienie projektowe
    robot wielofunkcyjny
    gra niekooperatywna
    planowanie kompleksowe
    planning problems
    multi-robot environment
    STRIPS language
    non-cooperative games
    planning complexity
    Opis:
    A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm that solves the problem described above is proposed and its computational complexity is analyzed. To make the plan precise, non-cooperative strategies are used.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 3; 359-367
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies