Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints

Authors:
Akiyoshi Shioura
Affiliations:
GSIS, Tohoku University, Sendai, Japan
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 22
Cited 0

On submodular function minimization

Combinatorica
Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
Valuated Matroid Intersection II: Algorithms

SIAM Journal on Discrete Mathematics
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Minimization of an M-convex function

Discrete Applied Mathematics
Discrete convex analysis

Mathematical Programming: Series A and B
M-Convex Function on Generalized Polymatroid

Mathematics of Operations Research
Regular Article: Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

Advances in Applied Mathematics
The Constrained Minimum Spanning Tree Problem (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities

Discrete Applied Mathematics - Submodularity
A Note on Kelso and Crawford's Gross Substitutes Condition

Mathematics of Operations Research
Presentation and structure of substitutes valuations

EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Combinatorial Auctions

Combinatorial Auctions
Maximizing Non-Monotone Submodular Functions

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Maximizing submodular set functions subject to multiple linear constraints

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On Maximizing Welfare When Utility Functions Are Subadditive

SIAM Journal on Computing
Approximation schemes for multi-budgeted independence systems

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

SIAM Journal on Discrete Mathematics
Budgeted matching and budgeted matroid intersection via the gasoline puzzle

Mathematical Programming: Series A and B
A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the maximization of a gross substitutes utility function under budget constraints. This problem naturally arises in applications such as exchange economies in mathematical economics and combinatorial auctions in (algorithmic) game theory. We show that this problem admits a polynomial-time approximation scheme (PTAS). More generally, we present a PTAS for maximizing a discrete concave function called an M-concave function under budget constraints. Our PTAS is based on rounding an optimal solution of a continuous relaxation problem, which is shown to be solvable in polynomial time by the ellipsoid method. We also consider the maximization of the sum of two M-concave functions under a single budget constraint. This problem is a generalization of the budgeted max-weight matroid intersection problem to the one with a nonlinear objective function. We show that this problem also admits a PTAS.