15 citations · 32 across the 9 of their papers we have counts for
10 papers
Facility Location Game with Envy Ratio
Yuan Ding, Wenjing Liu, Xin Chen +2
We study the one-facility location game on a real line with a new objective called envy ratio. The envy ratio, which is adopted from fair division and represents the egalitarianism…
Approximate Core Allocations for Edge Cover Games
Tianhang Lu, Han Xian, Qizhi Fang
We study the approximate core for edge cover games, which are cooperative games stemming from edge cover problems. In these games, each player controls a vertex on a network $G = (…
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…
A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks
Tiantian Chen, Bin Liu, Wenjing Liu +3
Online social networks have been one of the most effective platforms for marketing and advertising. Through "word of mouth" effects, information or product adoption could spread fr…
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.…
On the Convexity of Independent Set Games
Han Xiao, Yuanxi Wang, Qizhi Fang
Independent set games are cooperative games defined on graphs, where players are edges and the value of a coalition is the maximum cardinality of independent sets in the subgraph d…
The Least-core and Nucleolus of Path Cooperative Games
Qizhi Fang, Bo Li, Xiaohan Shan +1
Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative…
Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games
Qizhi Fang, Bo Li, Xiaoming Sun +2
Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts t…