Dynamic mechanism design (Q1014626): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maintaining information in fully dynamic trees with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation techniques for utilitarian mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralization and Mechanism Design for Online Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful and Near-Optimal Mechanism Design via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank

Latest revision as of 13:07, 1 July 2024

scientific article
Language Label Description Also known as
English
Dynamic mechanism design
scientific article

    Statements

    Dynamic mechanism design (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic mechanism design
    0 references
    truthful mechanisms
    0 references
    approximate mechanisms
    0 references
    on-line problems
    0 references
    dynamic algorithms
    0 references
    0 references