Qizhi Fang
YOU?
Author Swipe
View article: Approximate Core Allocations for Multiple Partners Matching Games
Approximate Core Allocations for Multiple Partners Matching Games Open
View article: On the Approximate Core and Nucleon of Flow Games with Public Arcs
On the Approximate Core and Nucleon of Flow Games with Public Arcs Open
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 this framework: the approximate core and the nucleon. The app…
View article: Mechanism Design with Predictions for Facility Location Games with Candidate Locations
Mechanism Design with Predictions for Facility Location Games with Candidate Locations Open
View article: Approximate Core Allocations for Edge Cover Games
Approximate Core Allocations for Edge Cover Games Open
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 = (V, E; w)$, and the cost of a coalition $S\subseteq V$ is eq…
View article: Predictions of the Outcomes for League of Legends and Diamond Price Using Regression Method
Predictions of the Outcomes for League of Legends and Diamond Price Using Regression Method Open
Intensified worldwide inflation has added panic to the public about confidence of monetary currency value. People devote themselves to searching for relative constant measurement on country or world economic level evaluation frequently. Un…
View article: Constrained Heterogeneous Two-facility Location Games with Max-variant Cost
Constrained Heterogeneous Two-facility Location Games with Max-variant Cost Open
In this paper, we propose a constrained heterogeneous facility location model where a set of alternative locations are feasible for building facilities and the number of facilities built at each location is limited. Supposing that a set of…
View article: Arboricity games: the core and the nucleolus
Arboricity games: the core and the nucleolus Open
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 cost-sharing in the minimum forest cover problem. We introdu…
View article: A study on the feature separation and extraction of compound faults of bearings based on casing vibration signals
A study on the feature separation and extraction of compound faults of bearings based on casing vibration signals Open
The autocorrelation function is combined with wavelet transform and cyclostationary theory (WT-AF-CT) in place of threshold denoising, and meanwhile the mean power ratio (MPR) is calculated by the proposed method. Furthermore, extracted ch…
View article: Population Monotonicity in Matching Games
Population Monotonicity in Matching Games Open
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 in the subgraph induced by the coalition. A population mono…
View article: Holistically assessing and improving the sustainability of aquaculture development in China
Holistically assessing and improving the sustainability of aquaculture development in China Open
Aquaculture is the fastest growing food production industry in terms of annual growth rate and has become an important contributor in supplying essential macro-and micro-nutrients for the global population. However, there is a great deal o…
View article: Population monotonic allocation schemes for vertex cover games
Population monotonic allocation schemes for vertex cover games Open
View article: On the Convexity of Independent Set Games
On the Convexity of Independent Set Games Open
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 defined by the coalition. In this paper, we investigate the …
View article: A random algorithm for profit maximization in online social networks
A random algorithm for profit maximization in online social networks Open
View article: The Least-core and Nucleolus of Path Cooperative Games
The Least-core and Nucleolus of Path Cooperative Games Open
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 games that arise from the situations where some commodity …