Pages that link to "Item:Q2506310"
From MaRDI portal
The following pages link to Combinatorial auctions with decreasing marginal utilities (Q2506310):
Displayed 9 items.
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Informational limitations of ascending combinatorial auctions (Q972880) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← links)
- Combinatorial auctions for electronic business (Q2571439) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)