[PDF] Top 20 Convexity of Graph-Restricted Games Induced by Minimum Partitions
Has 10000 "Convexity of Graph-Restricted Games Induced by Minimum Partitions" found on our website. Below are the top 20 most common "Convexity of Graph-Restricted Games Induced by Minimum Partitions".
Convexity of Graph-Restricted Games Induced by Minimum Partitions
... imply convexity but we think this notion is of interest in the context of communication ...games. Convexity corresponds to the idea that tendency for a player to join a coalition ... Voir le document complet
38
Convexity of graph-restricted games induced by minimum partitions
... imply convexity but we think this notion is of interest in the context of communication ...games. Convexity corresponds to the idea that tendency for a player to join a coalition ... Voir le document complet
37
Complexity of inheritance of F-convexity for restricted games induced by minimum partitions
... the minimum relationship degree in ...define restricted games (see, ...inheritance of basic properties as superadditivity and convexity from the underlying game to the restricted ... Voir le document complet
29
Convexity of Network Restricted Games Induced by Minimum Partitions
... Myerson’s restricted game only takes into account the connectivity be- tween ...group of players should be at least able to communicate together to cooper- ate and get their initial value but it can seem ... Voir le document complet
33
Games induced by the partitioning of a graph
... notion of restricted game on a communication graph, introduced by ...ways of partitioning any subset of a graph, which we call ...a graph is obtained by ... Voir le document complet
26
Coalition structures induced by the strength of a graph
... that convexity of the game (N, v) implies convexity of the new game ˜ v, and therefore the Shapley value of ˜ v is still in the core of ˜ ...another restricted game, ... Voir le document complet
30
Inheritance of Convexity for the P˜min-Restricted Game
... a restricted game on weighted graphs associated with minimum ...definition of Myer- son restricted game the connected components of any subgraph by the sub-components obtained ... Voir le document complet
38
Inheritance of Convexity for Partition Restricted Games
... associated graph Γ F . By assumption Γ F is con- nected and cycle-free and therefore a ...vertex of Γ. Therefore C l intersects only one subset C m with 1 ≤ m ≤ l − 1. By the same reasoning we ... Voir le document complet
34
Applying integer programming techniques to find minimum integer weights of voting games
... term signifies the additional parties that belong to non-exclusive ranks; the minimum weight for these parties is one. This is somewhat analogous to the maximum numb[r] ... Voir le document complet
76
A Complete Characterization of the Gap between Convexity and SOS-Convexity
... example of a convex form that is not an sum of ...value of n for which such a form ...constructions of convex but not sos-convex polynomials pass this necessary condition, the polynomials ... Voir le document complet
24
Approximation of values of hypergeometric functions by restricted rationals
... We study rational approximation to certain values of hyperbolic func- tions by restricted rationals x/y. For example, if x 2 + y 2 is a square then always |y sinh(1/s) − x| log log y/ log y. ... Voir le document complet
13
Minimum cost spanning tree games and population monotonic allocation schemes
... algorithm of Prim has proven its use in cost allocation. If one assigns the cost of an edge, which is formed in some step of the algorithm, to the player who gets a connection with the source, ... Voir le document complet
21
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
... HAL Id: hal-00487300 https://hal.archives-ouvertes.fr/hal-00487300 Submitted on 28 May 2010 HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, ... Voir le document complet
5
MEAN FIELD GAMES: A TOY MODEL ON AN ERDOS-RENYI GRAPH
... point of view, fixed points may be characterized as solutions of a forward-backward system made of two equations, a forward Fokker-Planck equation and a backward Hamilton-Jacobi-Bellman ...search ... Voir le document complet
25
The restricted core of games on distributive lattices: how to share benefits in a hierarchy
... one of the central problems in cooperative game theory, and the notion of core is the most popular solution concept since it is based on some rationality ...ordering of the players (or hier- ...teams ... Voir le document complet
21
On the minimum size of an identifying code over all orientations of a graph
... a graph G, we define id(G) as the minimum size of an identifying code of G if one exists, and id(G) = +∞ ...introduction of the concept in [19] and have been applied to problems such as ... Voir le document complet
24
Combining multiple partitions created with a graph-based construction for data clustering
... (percentage of cor- rectly labeled points). Results of our proposed methods on the synthetic data are shown in ...try of distribution is explored through the Prim construc- tion, whereas most other ... Voir le document complet
7
Approximation of variational problems with a convexity constraint by PDEs of Abreu type
... from the Leray-Schauder Theorem that T 1 has a fixed point in D, this proves the existence claim for (4.2). Finally, uniqueness follows from the same argument as in Lemma 7.1 from [10] where it is proven that two smooth ... Voir le document complet
16
Detecting rigid convexity of bivariate polynomials
... rigid convexity of a con- nected component delimited by ...form of a resultant called the B´ezoutian. As a by-product, the algorithm also solves the determinantal representation problem ... Voir le document complet
24
Calculus of variations with convexity constraint
... derivative of u, hence ∇u ∈ L ∞ loc (Ω) and it is easy to prove that ∇u = Du almost ...derivative of u at any point of the set A where it is ... Voir le document complet
24
Sujets connexes