Truthful mechanism design via correlated tree rounding (Q526848): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-016-1068-5 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-016-1068-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2511680749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds for Anonymous Scheduling Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful approximation mechanisms for scheduling selfish related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of VCG-based mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-norm approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful Generalized Assignments via Stable Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design for fractional scheduling on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for scheduling mechanisms / 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: Q3588651 / 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: On the Power of Randomization in Algorithmic Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of randomized mechanisms for combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From query complexity to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Approximation Algorithms for Maximum Separable Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: From convex optimization to randomized mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Truthful Scheduling on Related Machines / 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: Inapproximability results for combinatorial auctions with submodular utility functions / 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: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Mechanism Design (Randomized Rounding on the Fly) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful and Near-Optimal Mechanism Design via Linear Programming / 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: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Majorized Elements and Generalized Polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-016-1068-5 / rank
 
Normal rank

Latest revision as of 20:29, 9 December 2024

scientific article
Language Label Description Also known as
English
Truthful mechanism design via correlated tree rounding
scientific article

    Statements

    Truthful mechanism design via correlated tree rounding (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2017
    0 references
    mechanism design
    0 references
    rounding
    0 references
    combinatorial auctions
    0 references
    scheduling mechanisms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references