Pages that link to "Item:Q4951047"
From MaRDI portal
The following pages link to Algorithmic Aspects of the Core of Combinatorial Optimization Games (Q4951047):
Displaying 50 items.
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- 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)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← 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)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- Network bargaining: using approximate blocking sets to stabilize unstable instances (Q904691) (← 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)
- Three-valued simple games (Q1620913) (← links)
- The stable fixtures problem with payments (Q1651275) (← links)
- A note on maximal covering location games (Q1727959) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← 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)
- Population monotonic allocation schemes for vertex cover games (Q2006775) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Set-weighted games and their application to the cover problem (Q2083971) (← links)
- On the population monotonicity of independent set games (Q2084006) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- Population monotonicity in matching games (Q2136163) (← links)
- Minimum coloring problems with weakly perfect graphs (Q2149192) (← links)
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- Enforcing fair cooperation in production-inventory settings with heterogeneous agents (Q2241573) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830) (← links)
- Multi-sided assignment games on \(m\)-partite graphs (Q2288857) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- Gain-sharing in urban consolidation centers (Q2312331) (← links)
- Cooperative games with overlapping coalitions: charting the tractability frontier (Q2321289) (← links)
- Universally balanced combinatorial optimization games (Q2344942) (← 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)
