Search

Your search keyword '"Kang, Liying"' showing total 469 results
Start Over Author "Kang, Liying"
469 results on '"Kang, Liying"'

110. Tensor spectral properties of general hypergraphs.

Author

WANG Die and KANG Liying

Subjects
ISOPERIMETRIC inequalities, HYPERGRAPHS
Abstract

In this paper, we extend the concepts of inverse Perron values to general hypergraphs. We show that a general hypergraph G is connected if and only if any inverse Perron values is large than 0. We give some bounds on the bipartition width, isoperimetric number, eccentricities and degrees of a hypergraph G in terms of inverse Perron values. Finally, we obtain that a weakly irreducible, nonnegative, symmetric tensor A is odd-colorable if and only if its Laplacian tensor and the signless Laplacian tensor have the same spectral. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

139. The Two-Step Average Tree Value for Graph and Hypergraph Games

Author

Kang, Liying, Khmelnitskaya, Anna, Shan, Erfang, Talman, A.J.J., Zhang, Guang, and Econometrics and Operations Research

Subjects
Computer Science::Computer Science and Game Theory, TU game, average tree value, hypergraph communication structure, component fairness
Abstract

We introduce the two-step average tree value for transferable utility games with restricted cooperation represented by undirected communication graphs or hypergraphs. The solution can be considered as an alternative for both the average tree solution for graph games and the average tree value for hypergraph games. Instead of averaging players' marginal contributions corresponding to all admis-sible rooted spanning trees of the underlying (hyper)graph, which determines the average tree solution or value, we consider a two-step averaging procedure, in which in the first step for each player the average of players' marginal contributions corresponding to all admissible rooted spanning trees that have this player as the root is calculated, and in the second step the average over all players of all the payoffs obtained in the first step is computed. In general these two approaches lead to different solution concepts. When each component in the underlying communication structure is cycle-free, a linear cactus with cycles, or the complete graph, the two-step average tree value coincides with the average tree value. A comparative analysis of both solution concepts is done and an axiomatization of the the two-step average tree value on the subclass of TU games with semi-cycle-free hypergraph communication structure, which is more general than that given by a cycle-free hypergraph, is obtained.

Published
2020

Catalog

Books, media, physical & digital resources
See catalog results