Envy-free allocations respecting social networks (Q2124438): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q175575
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2022.103664 / rank
Normal rank
 
Property / author
 
Property / author: Rolf Niedermeier / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206998258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair assignment of indivisible objects under ordinal preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost envy-free allocations with connected bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Allocation of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed fair allocation of indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5830975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On social envy-freeness in multi-unit markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset sum problems with digraph constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with fixed number of bins revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing social welfare in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Welfare bounds in the fair division problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cake Cutting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained swap dynamics over a social network in distributed resource reallocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairly allocating contiguous blocks of indivisible items / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2022.103664 / rank
 
Normal rank

Latest revision as of 03:41, 17 December 2024

scientific article
Language Label Description Also known as
English
Envy-free allocations respecting social networks
scientific article

    Statements

    Envy-free allocations respecting social networks (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2022
    0 references
    directed
    0 references
    colored subgraph isomorphism
    0 references

    Identifiers