Order:
  1.  46
    Digraph Competitions and Cooperative Games.René van Den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.
    Digraph games are cooperative TU-games associated to domination structures which can be modeled by directed graphs. Examples come from sports competitions or from simple majority win digraphs corresponding to preference profiles in social choice theory. The Shapley value, core, marginal vectors and selectope vectors of digraph games are characterized in terms of so-called simple score vectors. A general characterization of the class of (almost positive) TU-games where each selectope vector is a marginal vector is provided in terms of game semi-circuits. (...)
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  2.  37
    Characterizations of the Β- and the Degree Network Power Measure.René Van Den Brink, Peter Borm, Ruud Hendrickx & Guillermo Owen - 2008 - Theory and Decision 64 (4):519-536.
    A symmetric network consists of a set of positions and a set of bilateral links between these positions. For every symmetric network we define a cooperative transferable utility game that measures the “power” of each coalition of positions in the network. Applying the Shapley value to this game yields a network power measure, the β-measure, which reflects the power of the individual positions in the network. Applying this power distribution method iteratively yields a limit distribution, which turns out to be (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  29
    Congestion Models and Weighted Bayesian Potential Games.Giovanni Facchini, Freek van Megen, Peter Borm & Stef Tijs - 1997 - Theory and Decision 42 (2):193-206.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  4.  39
    Axiomatic Characterizations of Solutions for Bayesian Games.Robert van Heumen, Bezalel Peleg, Stef Tijs & Peter Borm - 1996 - Theory and Decision 40 (2):103-129.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  5.  40
    Population Monotonic Path Schemes for Simple Games.Barış Çiftçi, Peter Borm & Herbert Hamers - 2010 - Theory and Decision 69 (2):205-218.
    A path scheme for a game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path. A path scheme is called population monotonic if a player’s payoff does not decrease as the path coalition grows. In this study, we focus on Shapley path schemes of simple games in which for every path coalition the Shapley value of the associated subgame (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  6.  29
    Minimum Cost Spanning Tree Games and Spillover Stability.Ruud Hendrickx, Jacco Thijssen & Peter Borm - 2012 - Theory and Decision 73 (3):441-451.
    This article discusses interactive minimum cost spanning tree problems and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each player’s decision whether or not to cooperate is properly taken into account.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  7.  34
    Internal Slackening Scoring Methods.Marco Slikker, Peter Borm & René van den Brink - 2012 - Theory and Decision 72 (4):445-462.
    We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships specified by a directed graph may reflect the outcomes of a sport competition, the mutual reference structure between websites, or a group preference structure over alternatives. We introduce a class of scoring methods for directed graphs, indexed by a single nonnegative parameter α. This parameter reflects the internal slackening of a node within an underlying iterative process. The class of so-called internal slackening scoring methods, (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  8.  19
    Transfers and Exchange-Stability in Two-Sided Matching Problems.Emiliya Lazarova, Peter Borm & Arantza Estévez-Fernández - 2016 - Theory and Decision 81 (1):53-71.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9. Digraph Competitions and Cooperation Games.René van den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.
    Direct download  
     
    Export citation  
     
    My bibliography