scholarly journals Optimal and near-optimal mechanism design with interdependent values

2013 ◽  
Author(s):  
Tim Roughgarden ◽  
Inbal Talgam-Cohen
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism ◽  
Interdependent Values

scholarly journals Average-Case Approximation Ratio of Scheduling without Payments

Algorithmica ◽  
2021 ◽  
Author(s):  
Jie Zhang
Keyword(s):  
Mechanism Design ◽  
Case Analysis ◽  
Theoretical Computer Science ◽  
Approximation Ratio ◽  
Approximation Schemes ◽  
Worst Case Analysis ◽  
Algorithmic Mechanism Design ◽  
Worst Case ◽  
Average Case ◽  
Optimal Mechanism

AbstractApart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and design of approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, is defined in the worst-case sense. It compares the performance of the optimal mechanism against the performance of a truthful mechanism, for all possible inputs. In this paper, we take the average-case analysis approach, and tackle one of the primary motivating problems in Algorithmic Mechanism Design—the scheduling problem (Nisan and Ronen, in: Proceedings of the 31st annual ACM symposium on theory of computing (STOC), 1999). One version of this problem, which includes a verification component, is studied by Koutsoupias (Theory Comput Syst 54(3):375–387, 2014). It was shown that the problem has a tight approximation ratio bound of $$(n+1)/2$$ ( n + 1 ) / 2 for the single-task setting, where n is the number of machines. We show, however, when the costs of the machines to executing the task follow any independent and identical distribution, the average-case approximation ratio of the mechanism given by Koutsoupias (Theory Comput Syst 54(3):375–387, 2014) is upper bounded by a constant. This positive result asymptotically separates the average-case ratio from the worst-case ratio. It indicates that the optimal mechanism devised for a worst-case guarantee works well on average.

Optimal Mechanism Design with Enforcement

2021 ◽  
Author(s):  
Petteri Palonen ◽  
Teemu Pekkarinen
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism

Optimal Mechanism Design for Fresh Data Acquisition

2021 ◽  
Author(s):  
Meng Zhang ◽  
Ahmed Arafa ◽  
Ermin Wei ◽  
Randall A. Berry
Keyword(s):  
Data Acquisition ◽  
Mechanism Design ◽  
Optimal Mechanism

Optimal mechanism design of in-pipe cleaning robot

2011 ◽  
Author(s):  
Chang Doo Jung ◽  
Won Jee Chung ◽  
Jin Su Ahn ◽  
Myung Sik Kim ◽  
Gi Soo Shin ◽  
...  
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism ◽  
Cleaning Robot

A RADIAL METHOD FOR OPTIMAL MECHANISM DESIGN

1992 ◽  
Vol 20 (3) ◽  
pp. 179-186 ◽  
Author(s):  
CHIANG KAO ◽  
ALBERT J. M. SHIH
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism

scholarly journals Optimal Mechanism Design of In-pipe Cleaning Robot

2012 ◽  
Vol 21 (1) ◽  
pp. 123-129 ◽  
Author(s):  
C.D. Jung ◽  
W.J. Chung ◽  
J.S. Ahn ◽  
G.S. Shin ◽  
S.J. Kwon
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism ◽  
Cleaning Robot
Sign in / Sign up

Export Citation Format

Share Document