263 research outputs found
-polynomial weakly distance-regular digraphs
A weakly distance-regular digraph is -polynomial if its attached scheme is
-polynomial. In this paper, we characterize all -polynomial weakly
distance-regular digraphs
Weakly distance-regular circulants, I
We classify certain non-symmetric commutative association schemes. As an
application, we determine all the weakly distance-regular circulants of one
type of arcs by using Schur rings. We also give the classification of primitive
weakly distance-regular circulants.Comment: 28 page
All solution graphs in multidimensional screening
We study general discrete-types multidimensional screening without any noticeable restrictions on valuations, using instead epsilon-relaxation of the incentive-compatibility constraints. Any active (becoming equality) constraint can be perceived as "envy" arc from one type to another, so the set of active constraints is a digraph. We find that: (1) any solution has an in-rooted acyclic graph ("river"); (2) for any logically feasible river there exists a screening problem resulting in such river. Using these results, any solution is characterized both through its spanning-tree and through its Lagrange multipliers, that can help in finding solutions and their efficiency/distortion properties.incentive compatibility; multidimensional screening; second-degree price discrimination; non-linear pricing; graphs
An extensive English language bibliography on graph theory and its applications, supplement 1
Graph theory and its applications - bibliography, supplement
- …