Pages that link to "Item:Q1433504"
From MaRDI portal
The following pages link to Application of M-convex submodular flow problem to mathematical economics (Q1433504):
Displaying 15 items.
- Randomized algorithms for finding the shortest negative cost cycle in networks (Q1693163) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- Competitive Equilibrium and Trading Networks: A Network Flow Approach (Q4994146) (← links)
- A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
- On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
- Multiple Exchange Property for M<sup><i>♮</i></sup>-Concave Functions and Valuated Matroids (Q5219670) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)
- A fair and truthful mechanism with limited subsidy (Q6494252) (← links)
