Page 11 - 第四届运筹青年论坛会议手册-0615

青年报告 | 第四届中国运筹青年论坛 09

The Vertex Arboricity of Some Restricted Graphs

王慧娟 青岛大学

The coloring of graphs has been a valuable research topic in the study of graph theory and it still has

many unresolved problems. According to different application problems, people draw a series of

theories of abnormal coloring, such as the vertex arboricity problem of graphs. The vertex arboricity

( )of a graph is the minimum number of subsets into which the vertex set of can be

partitioned so that each subset induces an acyclic graph. Recently, we study the vertex arboricity o

some restricted graphs and get some results with ( ) ≤ 2.

Irrational-Behavior-Proof Conditions for Stochastic Games over

Event Trees

王磊 青岛大学

The irrational-behavior-proof conditions (IBPs) are investigated in stochastic games over event trees.

The definitions of four kinds of irrational-behavior-proof conditions (IBPs) and coalition irrational-

behavior-proof conditions (CIBPs) are proposed and their relations are analyzed. A class of general

characteristic functions (GCFs) is built. Basing on such GCFs, IBPs and CIBPs are proved to be
held. In the transfrontier pollution control problem, IBPs and CIBPs are checked. This theory extends

the IBPs mechanism for sustainable cooperation in deterministic dynamic games to the cases in

stochastic games over event trees.