Pseudograph associahedra

Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and multiple edges, which are also allowed to be disconnected. We then consider deformations of pseudograph associahedra as their underlying graphs are altered by edge contractions and edge deletions.Comment: 25 pages, 22 figure

Chromatic numbers for facet colouring of some generalized associahedra

The chromatic number of a proper colouring of the facets of certain classes of generalized associahedra is studied. The exact values are obtained for the permutohedron and the associahedron, while lower and upper bounds are established for the $n$-dimensional cyclohedron, astrohedron and simple permutoassociahedron

Permutonestohedra

There are several real spherical models associated with a root arrangement, depending on the choice of a building set. The connected components of these models are manifolds with corners which can be glued together to obtain the corresponding real De Concini–Procesi models. In this paper, starting from any root system with finite Coxeter group W and any W -invariant building set, we describe an explicit realization of the real spherical model as a union of polytopes (nestohedra) that lie inside the chambers of the arrangement. The main point of this realization is that the convex hull of these nestohedra is a larger polytope, a permutonestohedron, equipped with an action of W or also, depending on the building set, of Aut ( ). The permutonestohedra are natural generalizations of Kapranov’s permutoassociahedra

Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025)

We introduce a theory on marginal values and their core stability for cooperative games with arbitrary coalition structure. The theory is based on the notion of nested sets and the complex of nested sets associated to an arbitrary set system and the M-extension of a game for this set. For a set system being a building set or partition system, the corresponding complex is a polyhedral complex, and the vertices of this complex correspond to maximal strictly nested sets. To each maximal strictly nested set is associated a rooted tree. Given characteristic function, to every maximal strictly nested set a marginal value is associated to a corresponding rooted tree as in [9]. We show that the same marginal value is obtained by using the M-extension for every permutation that is associated to the rooted tree. The GC-solution is defined as the average of the marginal values over all maximal strictly nested sets. The solution can be viewed as the gravity center of the image of the vertices of the polyhedral complex. The GC-solution differs from the Myerson-kind value defined in [2] for union stable structures. The HS-solution is defined as the average of marginal values over the subclass of so-called half-space nested sets. The NT-solution is another solution and is defined as the average of marginal values over the subclass of NT-nested sets. For graphical buildings the collection of NT-nested sets corresponds to the set of spanning normal trees on the underlying graph and the NT-solution coincides with the average tree solution. We also study core stability of the solutions and show that both the HS-solution and NT-solution belong to the core under half-space supermodularity, which is a weaker condition than convexity of the game. For an arbitrary set system we show that there exists a unique minimal building set containing the set system. As solutions we take the solutions for this building covering by extending in a natural way the characteristic function to it by using its Möbius inversion.Core;polytope;building set;nested set complex;Möbius inversion;permutations;normal fan;average tree solution;Myerson value