Pages that link to "Item:Q1423711"
From MaRDI portal
The following pages link to Submodularity of some classes of the combinatorial optimization games (Q1423711):
Displayed 11 items.
- On games arising from multi-depot Chinese postman problems (Q256685) (← links)
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Population monotonic allocation schemes for vertex cover games (Q2006775) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Graphs inducing totally balanced and submodular Chinese postman games (Q2449131) (← links)
- On the convexity of independent set games (Q2659079) (← links)
- Component Acquisition Games (Q3459305) (← links)
- An efficient characterization of submodular spanning tree games (Q5918917) (← links)