A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / 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: On Allocating Goods to Maximize Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3379036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact LPT-bound for maximizing the minimum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of contract negotiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579476 / 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: Tight approximation algorithms for maximum general assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-order additive discrete fuzzy measures and their representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundling equilibrium in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for combinatorial auctions with submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Max-Min Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth revelation in approximately efficient combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4583955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity theory and cryptology. An introduction to cryptocomplexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank

Latest revision as of 10:17, 7 July 2024

scientific article
Language Label Description Also known as
English
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
scientific article

    Statements

    A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    computational social choice
    0 references
    multiagent resource allocation
    0 references
    social welfare optimization
    0 references
    approximability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references