Mathematical programming approaches for social welfare maximization

Cites work

\(N\)-fold integer programming
\(n\)-fold integer programming in cubic time
A condition for matchability in hypergraphs
A constant-factor approximation algorithm for Nash social welfare with submodular valuations
A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
A Linear Programming Approach to the Cutting-Stock Problem
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
A new approximation technique for resource-allocation problems
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
A note on approximating weighted Nash social welfare with additive valuations
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
A polynomial-time approximation scheme for maximizing the minimum machine completion time
A strongly polynomial algorithm for bimodular integer linear programming
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
A Unified Continuous Greedy Algorithm for Submodular Maximization
A unified framework for designing EPTAS for load balancing on parallel machines
About the Structure of the Integer Cone and Its Application to Bin Packing
Advances on strictly \(\varDelta \)-modular IPs
Aggregation functions.
Algorithmic Game Theory
Algorithms for Scheduling Independent Tasks
An application of simultaneous diophantine approximation in combinatorial optimization
An approximation algorithm for max-min fair allocation of indivisible goods
An approximation algorithm for the generalized assignment problem
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
An EPTAS for scheduling on unrelated machines of few different types
An improved approximation algorithm for combinatorial auctions with submodular bidders
An improved lower bound for rank four scheduling
Approximating multiobjective knapsack problems
Approximating Nash social welfare by matching and local search
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Approximating the Nash Social Welfare with Indivisible Items
Approximating unrelated machine weighted completion time using iterative rounding and computer assisted proofs
Approximation algorithms for combinatorial auctions with complement-free bidders
Approximation algorithms for scheduling unrelated parallel machines
Approximation Algorithms for the Max-Min Allocation Problem
Approximation algorithms for the weighted Nash social welfare via convex and non-convex programs
Approximation schemes for scheduling on parallel machines
APX-hardness of maximizing Nash social welfare with indivisible items
Cake cutting algorithms
Carathéodory bounds for integer cones
Closing the gap for makespan scheduling via sparsification techniques
Collective decision making
Combinatorial \(n\)-fold integer programming and applications
Combinatorial auctions. Foreword by Vernon L. Smith.
Complexity of integer quasiconvex polynomial optimization
Complexity of scheduling few types of jobs on related and unrelated machines
Consensus of Subjective Probabilities: The Pari-Mutuel Method
Convex separable optimization is not much harder than linear optimization
Decomposition Principle for Linear Programs
Dependent randomized rounding via exchange properties of combinatorial structures
Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division. Illustrations by Irene Rothe
Envy-free relaxations for goods, chores, and mixed items
Equitable aggregations and multiple criteria analysis
Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
Fair Allocation of Indivisible Goods
Fairness and rank-weighted utilitarianism in resource allocation
Faster Algorithms for Integer Programs with Block Structure
Generalized Gini inequality indices
Geometric algorithms and combinatorial optimization.
scientific article; zbMATH DE number 5852793 (Why is no real title available?)
scientific article; zbMATH DE number 5017566 (Why is no real title available?)
scientific article; zbMATH DE number 5764883 (Why is no real title available?)
scientific article; zbMATH DE number 4089320 (Why is no real title available?)
scientific article; zbMATH DE number 44383 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 1015852 (Why is no real title available?)
scientific article; zbMATH DE number 6820261 (Why is no real title available?)
scientific article; zbMATH DE number 7051222 (Why is no real title available?)
scientific article; zbMATH DE number 2107836 (Why is no real title available?)
scientific article; zbMATH DE number 3249560 (Why is no real title available?)
scientific article; zbMATH DE number 2234775 (Why is no real title available?)
scientific article; zbMATH DE number 7651150 (Why is no real title available?)
scientific article; zbMATH DE number 7788439 (Why is no real title available?)
Hyperbolic Polynomials and Interior Point Methods for Convex Programming
Improved algorithms for computing Fisher's market clearing prices
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
Improved integrality gap in max-min allocation: or topology at the north pole
Inapproximability results for combinatorial auctions with submodular utility functions
Inequalities: theory of majorization and its applications
Inequity averse optimization in operational research
Integer program with bimodular matrix
Integer programming in parameterized complexity: five miniatures
Integer Programming with a Fixed Number of Variables
Integer programs with bounded subdeterminants and two nonzeros per row
Integer programs with nearly totally unimodular matrices: the cographic case
Lifting linear extension complexity bounds to the mixed-integer setting
LP solvable models for multiagent fair allocation problems
Maximizing a monotone submodular function subject to a matroid constraint
Maximizing Nash product social welfare in allocating indivisible goods
MaxMin allocation via degree lower-bounded arborescences
Measures of relative equality and their meaning in terms of social welfare
Mechanisms for multi-unit auctions
Mechanisms for multi-unit combinatorial auctions with a few distinct goods
MinCovTarget+: a fast heuristic algorithm for fair allocation
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
Minimum makespan scheduling with low rank processing times
Minkowski's Convex Body Theorem and Integer Programming
Multicriteria Optimization
Multilinear Extensions of Games
Nash social welfare, matrix permanent, and stable polynomials
Near-linear time algorithm for \(n\)-fold ILPs via color coding
New constructive aspects of the Lovász local lemma
On allocating goods to maximize fairness
On maximizing welfare when utility functions are subadditive
On ordered weighted averaging aggregation operators in multicriteria decisionmaking
On Polyhedral Approximations of the Second-Order Cone
On solving linear programs with the ordered weighted averaging objective.
On the approximability of trade-offs and optimal access of web sources
On the configuration-LP of the restricted assignment problem
On the foundations of linear and integer linear programming I
Optimal approximation for the submodular welfare problem in the value oracle model
Ordered weighted average combinatorial optimization: formulations and their properties
Parameterized algorithms
Parameterized algorithms for block-structured integer programs with large entries
Parameterized and approximation results for scheduling with a low rank processing time matrix
Pipage rounding: a new method of constructing algorithms with proven performance guarantee
Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
Polynomiality for bin packing with a constant number of item types
Rational convex programs and efficient algorithms for 2-player Nash and nonsymmetric bargaining games
Restricted max-min allocation: approximation and integrality gap
Santa claus meets hypergraph matchings
Satiation in Fisher markets and approximation of Nash social welfare
Scheduling and fixed-parameter tractability
Second-order cone programming
Separable convex mixed-integer optimization: improved algorithms and lower bounds
Set functions, games and capacities in decision making
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Submodular functions and optimization.
The bargaining problem
The design of approximation algorithms
The Nash Social Welfare Function
The Santa Claus problem
The submodular Santa Claus problem
The subspace flatness conjecture and faster integer programming
Using \(\ell^p\)-norms for fairness in combinatorial optimisation
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Which problems have strongly exponential complexity?

This page was built for publication: Mathematical programming approaches for social welfare maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397397)