Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132): 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: W4225771455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Social Welfare, Matrix Permanent, and Stable Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earning limits in Fisher markets with spending-constraint utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding fair and efficient allocations when valuations don't add up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective choice under dichotomous preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Nash Social Welfare with Indivisible Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Nash product social welfare in allocating indivisible goods / 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: On maximizing welfare when utility functions are subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Nash social welfare under rado valuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for maximin shares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Allocation of Indivisible Goods: Improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair division with binary valuations: one rule to rule them all / rank
 
Normal rank
Property / cites work
 
Property / cites work: APX-hardness of maximizing Nash social welfare with indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fair division of hereditary set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-unit assignment under dichotomous preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise kidney exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:18, 29 July 2024

scientific article
Language Label Description Also known as
English
Approximating Nash social welfare under binary XOS and binary subadditive valuations
scientific article

    Statements

    Approximating Nash social welfare under binary XOS and binary subadditive valuations (English)
    0 references
    0 references
    0 references
    6 July 2022
    0 references
    discrete fair division
    0 references
    Nash social welfare
    0 references
    binary marginals
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references