The Pareto frontier of inefficiency in mechanism design (Q777959): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Prior-independent mechanisms for scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design for fractional scheduling on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of 2-Player Mechanisms for Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Truthful <i>Mechanisms</i> for Job Scheduling from Bi-criterion Approximation <i>Algorithms</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The VCG Mechanism for Bayesian Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for deterministic truthful scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling without payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful mechanism design for multidimensional scheduling via cycle monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform price auctions: equilibria and efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting lower bounds on truthfulness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471277 / rank
 
Normal rank

Latest revision as of 10:36, 29 July 2024

scientific article; zbMATH DE number 7548053
  • The Pareto Frontier of Inefficiency in Mechanism Design
Language Label Description Also known as
English
The Pareto frontier of inefficiency in mechanism design
scientific article; zbMATH DE number 7548053
  • The Pareto Frontier of Inefficiency in Mechanism Design

Statements

The Pareto frontier of inefficiency in mechanism design (English)
0 references
The Pareto Frontier of Inefficiency in Mechanism Design (English)
0 references
0 references
0 references
0 references
30 June 2020
0 references
27 June 2022
0 references
mechanism design
0 references
price of anarchy
0 references
price of stability
0 references
Pareto frontier
0 references
scheduling unrelated machines
0 references
makespan minimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references