Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369): 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: Approximation algorithms for scheduling unrelated parallel machines / 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 16:25, 27 June 2024

scientific article; zbMATH DE number 5237480
Language Label Description Also known as
English
Improved Lower Bounds for Non-utilitarian Truthfulness
scientific article; zbMATH DE number 5237480

    Statements

    Identifiers