1,721,083 research outputs found
On a singular perturbation in the linear dispersive theory
Full text linkContains fulltext :
mmubn000001_135484634.pdf (Publisher’s version ) (Open Access)Promotor : L. Frank67 p
The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games
Full text linkAbstract: In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the degree adjusted folk solution and the cost adjusted folk solution. These solutions overcome the problem of the classical reductionist folk solution as they have considerable strict ranking power, without breaking established axioms. As such they provide affirmative answers to open questions, put forward in Bogomolnaia and Moulin (2010) and Bogomolnaia et al. (2010)
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Incomplete stable structures in symmetric convex games
No full textWe study the model of link formation that was introduced by Aumann and Myerson [in: A. Roth (Ed.), The Shapley Value. Cambridge Univ. Press, 1988, pp. 175–191] and focus on symmetric convex games with transferable utilities. We show that with at most five players the full cooperation structure results according to a subgame perfect Nash equilibrium. Moreover, if the game is strictly convex then every subgame perfect Nash equilibrium results in a structure that is payoff equivalent to the full cooperation structure. Subsequently, we analyze a game with six players that is symmetric and strictly convex. We show that there exists a subgame perfect Nash equilibrium that results in an incomplete structure in which two players are worse off than in the full cooperation structure, whereas four players are better off. Independent of the initial order any pair of players can end up being exploited
- …
