Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057098288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted matching and budgeted matroid intersection via the gasoline puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximizing Welfare When Utility Functions Are Subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Continuous Greedy Algorithm for Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polymatroids and submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Kelso and Crawford's Gross Substitutes Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Multi-Budgeted Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walrasian equilibrium with gross substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Matching, Coalition Formation, and Gross Substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3632447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Function on Generalized Polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of M-convexity and L-convexity to polyhedral convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of M-convex submodular flow problem to mathematical economics / rank
 
Normal rank
Property / cites work
 
Property / cites work: New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:59, 9 July 2024

scientific article; zbMATH DE number 6422226
Language Label Description Also known as
English
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints
scientific article; zbMATH DE number 6422226

    Statements

    Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (English)
    0 references
    0 references
    1 April 2015
    0 references
    discrete concave function
    0 references
    submodular function
    0 references
    budget constraints
    0 references
    gross substitutes utility
    0 references
    polynomial-time approximation scheme
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers