Pages that link to "Item:Q4951047"
From MaRDI portal
The following pages link to Algorithmic Aspects of the Core of Combinatorial Optimization Games (Q4951047):
Displayed 28 items.
- On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Buyer-supplier games: optimization over the core (Q627118) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Computing solutions for matching games (Q662281) (← links)
- Dominating set games. (Q703283) (← links)
- Social exchange networks with distant bargaining (Q744107) (← links)
- Complexity of core allocation for the bin packing game (Q833586) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- Production-inventory games and PMAS-games: Characterizations of the Owen point (Q931787) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Production-inventory games: A new class of totally balanced combinatorial optimization games (Q1002332) (← links)
- On core stability, vital coalitions, and extendability (Q1036591) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Total balancedness condition for Steiner tree games. (Q1811075) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830) (← links)
- Balancedness of edge covering games (Q2471286) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- A note on balancedness of dominating set games (Q2583171) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (Q2883612) (← links)
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
- ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES (Q3395219) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)