Ara es mostren els items 218-237 de 242

    • Teoria de jocs: investigació de diversos models de xarxes i usuaris egoistes 

      Francès Medina, Guillem (Universitat Politècnica de Catalunya, 2007-01-23)
      Projecte/Treball Final de Carrera
      Accés obert
    • Teoría de juegos 

      Carreras Escobar, Francisco; Magaña Nieto, Antonio; Amer Ramon, Rafael (Edicions UPC, 2001)
      Llibre
      Accés restringit a la comunitat UPC
      El presente libro va dirigido principalmente a los estudiantes de organización industrial. No es un tratado, sino una introducción a la teoria de juegos, que pretende exponer la temática y la metodología de esta rama de ...
    • Teoría de juegos 

      Carreras Escobar, Francisco; Magaña Nieto, Antonio; Amer Ramon, Rafael (Edicions UPC, 2005)
      Llibre
      Accés restringit a la comunitat UPC
      El presente libro va dirigido principalmente a los estudiantes de organización industrial. No es un tratado, sino una introducción a la teoria de juegos, que pretende exponer la temática y la metodología de esta rama de ...
    • The allowable hierarchies in simple games 

      Freixas Bosch, Josep; Pons Vallès, Montserrat (2009)
      Report de recerca
      Accés restringit per decisió de l'autor
      Estudi de les jerarquies que són possibles per jocs simples
    • The complexity of power indices in voting games with incompatible players 

      Jané Ballarín, Martí (Universitat Politècnica de Catalunya, 2023-01-23)
      Projecte Final de Màster Oficial
      Accés obert
      We study the complexity of computing the Banzhaf index in incompatibility games. We show: 1) weak #P-completeness for computing the index when the incompatibility graph has very few maximal independent sets, 2) strong ...
    • The complexity of pure nash equilibria in max-congestion games 

      Francès Medina, Guillem (Universitat Politècnica de Catalunya, 2008-09-08)
      Projecte Final de Màster Oficial
      Accés obert
      We study Network Max-Congestion Games (NMC games, for short), a class of network games where each player tries to minimize the most congested edge along the path he uses as strategy. We focus our study on the complexity of ...
    • The complexity of testing properties of simple games 

      Freixas Bosch, Josep; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2008-04-04)
      Report de recerca
      Accés obert
      Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which ...
    • The cost of getting local monotonicity 

      Freixas Bosch, Josep; Kurz, Sascha (Elsevier, 2016-06-01)
      Article
      Accés obert
      Committees with yes-no-decisions are commonly modeled as simple games and the ability of a member to influence the group decision is measured by so-called power indices. For a weighted game we say that a power index satisfies ...
    • The game theory analysis on covering overall migrant workers by their participation in legal housing reserves 

      Chen, Ai (2015-03)
      Article
      Accés obert
      According to the policies from different provinces and regions, existing problems are analyzed. With the game theory analysis,backgrounds and processes of the policies are imitated based on institution ...
    • The golden number and Fibonacci sequences in the design of voting structures 

      Freixas Bosch, Josep; Kurz, Sascha (Elsevier, 2013)
      Article
      Accés obert
      Some distinguished types of voters, as vetoes, passers or nulls, as well as some others, play a significant role in voting systems because they are either the most powerful or the least powerful voters in the game independently ...
    • The High Perfomance Scheduler Game: A Characterization of Slurm, Metrics, and the Viability of Cooperation 

      Uruchi Ticona, Wilmer Vidal (Universitat Politècnica de Catalunya, 2020-07)
      Projecte Final de Màster Oficial
      Accés obert
      The Slurm Scheduler is a widely used tool for scheduling in High Per- formance Computing platforms around the world. Several studies have been conducted to nd ways to improve speci c performance metrics, mainly from ...
    • The influence of the node criticality relation on some measures of component importance 

      Freixas Bosch, Josep; Pons Vallès, Montserrat (2009)
      Report de recerca
      Accés restringit per decisió de l'autor
      Estudi de la relació entre diverses mesures d'importància probabilístiques i la relació crítica associada al sistema
    • The proportional partitional Shapley value 

      Alonso Meijide, José María; Carreras Escobar, Francisco; Costa Bouzas, Julián; García Jurado, Ignacio (2015-05)
      Article
      Accés obert
      A new coalitional value is proposed under the hypothesis of isolated unions. The main difference between this value and the Aumann–Drèze value is that the allocations within each union are not given by the Shapley value ...
    • The representativeness reliability importance measure 

      Freixas Bosch, Josep; Pons Vallès, Montserrat (2014)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      A new reliability importance measure for components in a system, that we call Representativeness measure, is introduced. It evaluates to which extent the performance of a component is representative of the performance ...
    • The robustness of periodic orchestrations in uncertain evolving environments 

      Castro Rabal, Jorge; Gabarró Vallès, Joaquim; Serna Iglesias, María José; Stewart, Alan (Springer, 2015)
      Text en actes de congrés
      Accés obert
      A framework for assessing the robustness of long-duration repetitive orchestrations in uncertain evolving environments is proposed. The model assumes that service-based evaluation environments are stable over short ...
    • The Shapley value analyzed under the Felsenthal and Machover bargaining model 

      Bernardi, Giulia; Freixas Bosch, Josep (2018-05-23)
      Article
      Accés obert
      In 1996, Felsenthal and Machover proposed a bargaining procedure for a valuable payoff in cooperative and simple games. They proved that the value underlying their bargaining scheme was the Shapley value by showing that ...
    • The Speed of social contagion 

      Llueca Martinez, Pablo (Universitat Politècnica de Catalunya, 2016-04-26)
      Treball Final de Grau
      Accés obert
      Estudi de el problema maximitzar la difusió de la informació en xarxes socials. Es planteja un model de joc estrategic. S'estudia la existencia de Nash Equilibria com a concepte de solució. S'estudia la qualitat de aquestes ...
    • Two approaches to fuzzification of payments in NTU coalitional game 

      Mareš, Milan (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
      Article
      Accés obert
      There exist several possibilities of fuzzification of a coalitional game. It is quite usual to fuzzify, e.\,g., the concept of coalition, as it was done in [1]. Another possibility is to fuzzify the expected pay-offs, ...
    • Unranking algorithms for combinatorial structures 

      Molinero Albareda, Xavier; Vives Pons, Jordi (2015-12)
      Article
      Accés obert
      We present an implementation of some unlabeled and labeled unranking algorithms for the open-source algebraic combinatorics package MUPAD-COMBINAT of the computer algebra system MUPAD. We have compared our implementation ...
    • Using the multilinear extension to study some probabilistic power indices 

      Freixas Bosch, Josep; Pons Vallès, Montserrat (2017-05-01)
      Article
      Accés obert
      We consider binary voting systems modeled by a simple game, in which voters vote independently of each other, and the probability distribution over coalitions is known. The Owen’s multilinear extension of the simple game ...