A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
From MaRDI portal
Publication:2436693
Recommendations
- Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation
- Maximizing Nash product social welfare in allocating indivisible goods
- Multiagent resource allocation in k-additive domains: preference representation and complexity
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- APX-hardness of maximizing Nash social welfare with indivisible items
Cites work
- k-order additive discrete fuzzy measures and their representation
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- An approximation algorithm for max-min fair allocation of indivisible goods
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation Algorithms for the Max-Min Allocation Problem
- Bundling equilibrium in combinatorial auctions
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combinatorial auctions
- Combinatorial auctions with decreasing marginal utilities
- Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Computational Complexity of Probabilistic Turing Machines
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5017566 (Why is no real title available?)
- scientific article; zbMATH DE number 5485443 (Why is no real title available?)
- scientific article; zbMATH DE number 5764883 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- scientific article; zbMATH DE number 7051222 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Inapproximability results for combinatorial auctions with submodular utility functions
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Multiagent resource allocation in k-additive domains: preference representation and complexity
- On allocating goods to maximize fairness
- On maximizing welfare when utility functions are subadditive
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Optimal approximation for the submodular welfare problem in the value oracle model
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Some optimal inapproximability results
- The complexity of contract negotiation
- The exact LPT-bound for maximizing the minimum completion time
- The Santa Claus problem
- Tight approximation algorithms for maximum general assignment problems
- Truth revelation in approximately efficient combinatorial auctions
Cited in
(17)- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Local fairness in hedonic games via individual threshold coalitions
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
- The price to pay for forgoing normalization in fair division of indivisible goods
- Effective deadlock resolution with self-interested partially-rational agents
- Exploration costs as a means for improving performance in multiagent systems
- Multiagent resource allocation in k-additive domains: preference representation and complexity
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
- Approximating the Nash Social Welfare with Indivisible Items
- Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Duplication monotonicity in the allocation of indivisible goods
- Generalized graph k-coloring games
- MinCovTarget+: a fast heuristic algorithm for fair allocation
- The incentive guarantees behind Nash welfare in divisible resources allocation
- Fair assignment of indivisible objects under ordinal preferences
This page was built for publication: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436693)
