2 citations · 3 across the 8 of their papers we have counts for
6 papers · 1 filter
A Complete Characterization of Convexity in Flow Games
Han Xiao, Luying Zhang, Qizhi Fang
Flow games coincide precisely with non-negative totally balanced games. We give a complete characterization of convexity for flow games with one arc per player. We prove that such…
On the Approximate Core and Nucleon of Flow Games with Public Arcs
Pengfei Liu, Han Xiao, Tianhang Lu +1
We investigate flow games featuring both private arcs owned by individual players and public arcs accessible cost-free to all coalitions. We explore two solution concepts within th…
Approximate Core Allocations for Multiple Partners Matching Games
Han Xiao, Tianhang Lu, Qizhi Fang
The matching game is a cooperative game where the value of every coalition is the maximum revenue of players in the coalition can make by forming pairwise disjoint partners. The mu…
Population Monotonicity in Matching Games
Han Xiao, Qizhi Fang
A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings…
Arboricity games: the core and the nucleolus
Han Xiao, Qizhi Fang
The arboricity of a graph is the minimum number of forests required to cover all its edges. In this paper, we examine arboricity from a game-theoretic perspective and investigate c…
Population Monotonic Allocation Schemes for Vertex Cover Games
Han Xiao, Qizhi Fang, Ding-Zhu Du
For vertex cover games (introduced by Deng et al., Math. Oper. Res., 24:751-766, 1999), we investigate population monotonic allocation schemes (introduced by Sprumont, Games Econ.…