Fair by design: multidimensional envy-free mechanisms (Q2345204): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.geb.2014.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047815293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Power of Demand Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Truthful PTAS for Scheduling Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Envy-Free Makespan Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strategy Structure of Two-Sided Matching Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful Approximation Schemes for Single-Parameter Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / 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: A lower bound of \(1+\varphi \) for truthful scheduling mechanisms / 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: Q4910748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-dimensional Envy-Free Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication requirements of efficient allocations and supporting prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank

Latest revision as of 03:04, 10 July 2024

scientific article
Language Label Description Also known as
English
Fair by design: multidimensional envy-free mechanisms
scientific article

    Statements

    Fair by design: multidimensional envy-free mechanisms (English)
    0 references
    0 references
    19 May 2015
    0 references
    0 references
    envy-free allocations
    0 references
    optimization
    0 references
    profit maximization
    0 references
    mechanism design
    0 references
    0 references