scientific article; zbMATH DE number 7204350
From MaRDI portal
Publication:5111230
DOI10.4230/LIPIcs.MFCS.2017.16zbMath1441.91019arXiv1705.07200MaRDI QIDQ5111230
Jie Zhang, Yansong Gao, Xiaotie Deng
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1705.07200
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design ⋮ Average-case approximation ratio of scheduling without payments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for scheduling mechanisms
- Smoothed analysis of termination of linear programming algorithms
- Scheduling without payments
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- On a conjecture by Gale about one-sided matching problems
- Optimal auctions vs. anonymous pricing
- Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
- Smoothed analysis of binary search trees
- Strategy-proof allocation of indivisible goods
- An introduction to strategy-proof social choice functions
- On smoothed analysis of quicksort and Hoare's find
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- Truthful approximation mechanisms for restricted combinatorial auctions
- Topology matters: smoothed competitiveness of metrical task systems
- Algorithmic mechanism design (extended abstract)
- Bayesian algorithmic mechanism design
- Social Welfare in One-Sided Matchings: Random Priority and Beyond
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
- Lotteries in student assignment: An equivalence result
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Truth revelation in approximately efficient combinatorial auctions
- A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
- Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method
- The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Smoothed analysis of algorithms
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
- Mathematical Foundations of Computer Science 2003
- Algorithmic Game Theory
- Algorithmic mechanism design
- A new solution to the random assignment problem.
This page was built for publication:
