The following pages link to Qizhi Fang (Q201372):
Displayed 50 items.
- (Q511704) (redirect page) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Path cooperative games (Q724748) (← links)
- Condorcet winners for public goods (Q816518) (← links)
- On computational complexity of membership test in flow games and linear production games (Q1414436) (← links)
- On the computational complexity of upper total domination (Q1421481) (← links)
- Computing the Shapley value of threshold cardinality matching games (Q1624712) (← links)
- Bin packing game with a price of anarchy of \(\frac{3}{2}\) (Q1702843) (← links)
- Total balancedness condition for Steiner tree games. (Q1811075) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- Population monotonic allocation schemes for vertex cover games (Q2006775) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Strategyproof mechanisms for 2-facility location games with minimax envy (Q2039669) (← links)
- Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
- Population monotonicity in matching games (Q2136163) (← links)
- Strategyproof mechanisms for \(2\)-facility location games with minimax envy (Q2156318) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830) (← links)
- Profit maximization problem with coupons in social networks (Q2282999) (← links)
- A random algorithm for profit maximization in online social networks (Q2283001) (← links)
- General rumor blocking: an efficient random algorithm with martingale approach (Q2283009) (← links)
- Competitive profit maximization in social networks (Q2404075) (← links)
- Centralized and decentralized rumor blocking problems (Q2410051) (← links)
- Maximizing profit of multiple adoptions in social networks with a martingale approach (Q2424792) (← links)
- Balancedness of edge covering games (Q2471286) (← links)
- Existence of 0-1 universal minimal total dominating functions (Q2574289) (← links)
- A note on balancedness of dominating set games (Q2583171) (← links)
- On the convexity of independent set games (Q2659079) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Order based algorithms for the core maintenance problem on edge-weighted graphs (Q2680857) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- Constrained heterogeneous facility location games with max-variant cost (Q2698023) (← links)
- (Q2919747) (← links)
- An Incentive Mechanism for Selfish Bin Covering (Q2958351) (← links)
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
- Approximate Rank Aggregation (Q3082934) (← links)
- Majority Equilibrium for Public Facility Allocation (Q3082950) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
- Core Decomposition, Maintenance and Applications (Q3297830) (← links)
- CORE STABILITY OF DOMINATING SET GAMES (Q3504847) (← links)
- Algorithmic Cooperative Game Theory (Q3528695) (← links)
- Core Stability of Vertex Cover Games (Q3574302) (← links)
- Top-d Rank Aggregation in Web Meta-search Engine (Q3587334) (← links)
- Core Stability of Flow Games (Q3595419) (← links)
- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games (Q3608868) (← links)
- Call Control and Routing in SONET Rings (Q3611916) (← links)
- (Q3640351) (← links)
- (Q4551363) (← links)
- A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games (Q5024477) (← links)