Fast payment schemes for truthful mechanisms with verification (Q1006066): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Constructions of Mechanisms with Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The absolute center of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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: Q3624066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 04:27, 29 June 2024

scientific article
Language Label Description Also known as
English
Fast payment schemes for truthful mechanisms with verification
scientific article

    Statements

    Identifiers