Pages that link to "Item:Q1423711"
From MaRDI portal
The following pages link to Submodularity of some classes of the combinatorial optimization games (Q1423711):
Displaying 21 items.
- On games arising from multi-depot Chinese postman problems (Q256685) (← links)
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- On some balanced, totally balanced and submodular delivery games (Q1961984) (← links)
- Population monotonic allocation schemes for vertex cover games (Q2006775) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- Some new results on generalized additive games (Q2121459) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Combinatorial analysis of a subtraction game on graphs (Q2402945) (← links)
- Graphs inducing totally balanced and submodular Chinese postman games (Q2449131) (← links)
- On the convexity of independent set games (Q2659079) (← links)
- The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game (Q2689422) (← links)
- Polymatroid optimization, submodularity, and joint replenishment games (Q2892220) (← links)
- Component Acquisition Games (Q3459305) (← links)
- A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games (Q5024477) (← links)
- An efficient characterization of submodular spanning tree games (Q5918917) (← links)
- A branch-and-cut algorithm for submodular interdiction games (Q6364047) (← links)
