A new lower bound for deterministic truthful scheduling (Q5918088): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal Lower Bounds for Anonymous Scheduling Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of verification for one-parameter agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copula-based randomized mechanisms for truthful scheduling on two unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prior-independent mechanisms for scheduling / 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: Mechanism design for fractional scheduling on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nisan-Ronen conjecture for submodular valuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for scheduling mechanisms / 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: Bayesian Truthful <i>Mechanisms</i> for Job Scheduling from Bi-criterion Approximation <i>Algorithms</i> / 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: The Pareto frontier of inefficiency in mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for deterministic truthful scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The VCG Mechanism for Bayesian Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anarchy of scheduling without money / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling without payments / 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 lower bound of \(1+\varphi \) for truthful scheduling mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for truthful scheduling on two unrelated selfish machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful mechanism design for multidimensional scheduling via cycle monotonicity / 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: Setting lower bounds on truthfulness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal collusion-resistant mechanisms with verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful optimization using mechanisms with verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful mechanisms for two-range-values variant of unrelated scheduling / rank
 
Normal rank

Revision as of 12:34, 26 July 2024

scientific article; zbMATH DE number 7390205
Language Label Description Also known as
English
A new lower bound for deterministic truthful scheduling
scientific article; zbMATH DE number 7390205

    Statements

    A new lower bound for deterministic truthful scheduling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2021
    0 references
    0 references
    0 references
    0 references

    Identifiers