Improved lower bounds for non-utilitarian truthfulness (Q627119): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convex programming for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation / 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: Q2934711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful randomized mechanisms for combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BGP-based mechanism for lowest-cost routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / 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: 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: Q2934709 / 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

Latest revision as of 19:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Improved lower bounds for non-utilitarian truthfulness
scientific article

    Statements

    Improved lower bounds for non-utilitarian truthfulness (English)
    0 references
    0 references
    21 February 2011
    0 references
    algorithmic mechanism design
    0 references
    non-utilitarian inapproximability
    0 references
    inter-domain routing problem
    0 references
    unrelated machines scheduling problem
    0 references

    Identifiers