Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: House allocation with existing tenants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating optimal social choice under metric preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of random serial dictatorship / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social Welfare in One-Sided Matching Markets without Money / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of partitioning algorithms for Euclidean functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution to the random assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average number of pivot steps required by the Simplex-Method is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth, justice, and cake cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for scheduling mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social Welfare in One-Sided Matchings: Random Priority and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On smoothed analysis of quicksort and Hoare's find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to the random assignment problem on the full preference domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why do popular mechanisms lack efficiency in random environments? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling without payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful approximation mechanisms for restricted combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lotteries in student assignment: An equivalence result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology matters: smoothed competitiveness of metrical task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of termination of linear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proof allocation of indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture by Gale about one-sided matching problems / rank
 
Normal rank

Latest revision as of 05:55, 29 July 2024

scientific article
Language Label Description Also known as
English
Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design
scientific article

    Statements

    Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    approximation ratio
    0 references
    average-case analysis
    0 references
    mechanism design
    0 references
    smoothed analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers