Buyback problem with discrete concave valuation functions
From MaRDI portal
Publication:1751249
DOI10.1016/j.disopt.2017.07.002zbMath1387.90215OpenAlexW2750329558MaRDI QIDQ1751249
Takeshi Tokuyama, Shun Fukuda, Akiyoshi Shioura
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2017.07.002
matroidbuyback problemdiscrete concave functiongross substitutes valuationonline discrete optimization problem
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online unweighted knapsack problem with removal cost
- Convexity and Steinitz's exchange property
- Valuated matroids: A new look at the greedy algorithm
- Discrete convex analysis
- Walrasian equilibrium with gross substitutes
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Gross substitutability: an algorithmic survey
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial auctions with decreasing marginal utilities
- M-Convex Function on Generalized Polymatroid
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Unit Cost Buyback Problem
- Recent Developments in Discrete Convex Analysis
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- Job Matching, Coalition Formation, and Gross Substitutes
- Discrete Convex Analysis
- Valuated Matroid Intersection I: Optimality Criteria
- Online Submodular Maximization with Preemption
- Randomized Algorithms for Removable Online Knapsack Problems
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- A Note on Kelso and Crawford's Gross Substitutes Condition
