Pages that link to "Item:Q4581762"
From MaRDI portal
The following pages link to Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762):
Displayed 6 items.
- Escaping Braess's paradox through approximate Caratheodory's theorem (Q2094366) (← links)
- Equilibrium computation in resource allocation games (Q2149542) (← links)
- Correction to: ``Equilibrium computation in resource allocation games'' (Q2149544) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function (Q5919290) (← links)
- A common generalization of budget games and congestion games (Q6109524) (← links)