Pages that link to "Item:Q4951047"

The following pages link to Algorithmic Aspects of the Core of Combinatorial Optimization Games (Q4951047):

Displaying 23 items.

• On the convexity of independent set games (Q2659079) (← links)
• Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
• On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
• Arboricity games: the core and the nucleolus (Q2687037) (← links)
• A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
• The Stable Fixtures Problem with Payments (Q2827801) (← links)
• The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (Q2883612) (← links)
• Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
• LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
• Stabilizing Weighted Graphs (Q3387926) (← links)
• ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES (Q3395219) (← links)
• Component Acquisition Games (Q3459305) (← links)
• Computing Stable Coalitions: Approximation Algorithms for Reward Sharing (Q3460775) (← links)
• Graph Stabilization: A Survey (Q4689625) (← links)
• Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
• (Q5002762) (← links)
• (Q5002844) (← links)
• A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games (Q5024477) (← links)
• Finding nucleolus of flow game (Q5896983) (← links)
• Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
• The enemy of my enemy is my friend: new conditions for network games (Q6088194) (← links)
• Approximate core allocations for edge cover games (Q6122606) (← links)
• The complexity of matching games: a survey (Q6488787) (← links)