Pages that link to "Item:Q2757584"
From MaRDI portal
The following pages link to \(M\)-convex function on generalized polymatroid (Q2757584):
Displaying 50 items.
- Identifying combinatorial valuations from aggregate demand (Q406412) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions (Q495853) (← links)
- Cone superadditivity of discrete convex functions (Q715073) (← links)
- A constructive proof for the induction of M-convex functions through networks (Q1383387) (← links)
- Minimization of an M-convex function (Q1392577) (← links)
- Gross substitution, discrete convexity, and submodularity (Q1410681) (← links)
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization (Q1410696) (← links)
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. (Q1410697) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
- Independence systems in gross-substitute valuations (Q1627008) (← links)
- Convex analysis and duality over discrete domains (Q1660291) (← links)
- Discrete convexity in joint winner property (Q1662162) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- New sufficient conditions for strong unimodality of multivariate discrete distributions (Q1701085) (← links)
- Simpler exchange axioms for M-concave functions on generalized polymatroids (Q1742881) (← links)
- A stronger multiple exchange property for \(\mathrm{M}^{\natural }\)-concave functions (Q1742897) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Discrete convexity and unimodularity. I. (Q1763636) (← links)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
- \(M\)-convex functions and tree metrics (Q1764353) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434) (← links)
- Some specially structured assemble-to-order systems (Q1785487) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Discrete polymatroids (Q1863000) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- Discrete 2-convex functions (Q2089790) (← links)
- A note on M-convex functions on jump systems (Q2217499) (← links)
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra (Q2237937) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments (Q2409677) (← links)
- A generalized-polymatroid approach to disjoint common independent sets in two matroids (Q2421866) (← links)
- Discrete convexity built on differences (Q2452051) (← links)
- Indivisible commodities and the nonemptiness of the weak core (Q2469545) (← links)
- A general two-sided matching market with discrete concave utility functions (Q2492196) (← links)
- A note on discrete convexity and local optimality (Q2493486) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave (Q2636818) (← links)
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis (Q2696978) (← links)
