Pages that link to "Item:Q1575068"

The following pages link to Totally balanced combinatorial optimization games (Q1575068):

Displaying 29 items.

• On games arising from multi-depot Chinese postman problems (Q256685) (← links)
• Simple and three-valued simple minimum coloring games (Q343804) (← links)
• Competitive cost sharing with economies of scale (Q547291) (← links)
• Permutation games: Another class of totally balanced games (Q792888) (← links)
• Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
• Production-inventory games and PMAS-games: Characterizations of the Owen point (Q931787) (← links)
• Production-inventory games: A new class of totally balanced combinatorial optimization games (Q1002332) (← links)
• On the submodularity of multi-depot traveling salesman games (Q1727725) (← links)
• Combinatorial optimization in Nash games (Q1802492) (← links)
• Total balancedness condition for Steiner tree games. (Q1811075) (← links)
• A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (Q1941537) (← links)
• Population monotonic allocation schemes for vertex cover games (Q2006775) (← links)
• Facets of the cone of totally balanced games (Q2009181) (← 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)
• Some new results on generalized additive games (Q2121459) (← links)
• Population monotonicity in matching games (Q2136163) (← links)
• Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
• On stability of collaborative supplier selection (Q2294226) (← links)
• Universally balanced combinatorial optimization games (Q2344942) (← links)
• Graphs inducing totally balanced and submodular Chinese postman games (Q2449131) (← links)
• Balancedness of edge covering games (Q2471286) (← links)
• A note on balancedness of dominating set games (Q2583171) (← links)
• The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
• Subadditive and Homogeneous of Degree One Games Are Totally Balanced (Q2931699) (← links)
• LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
• Component Acquisition Games (Q3459305) (← links)
• (Q4546336) (← links)