A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3002852 / 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: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of 2-Player Mechanisms for Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for scheduling mechanisms / 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: Q4910748 / 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: Envy-Free Makespan Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-dimensional Envy-Free Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful mechanisms for two-range-values variant of unrelated scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / 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: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3452917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity and Implementability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful germs are contagious: a local-to-global characterization of truthfulness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank

Latest revision as of 10:18, 6 July 2024

scientific article
Language Label Description Also known as
English
A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
scientific article

    Statements

    A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    algorithmic game theory
    0 references
    mechanism design
    0 references
    scheduling unrelated machines
    0 references
    truthful
    0 references
    lower bound
    0 references
    dominant strategies
    0 references
    multiparameter mechanism design
    0 references

    Identifiers