A lower bound for scheduling mechanisms
type: Item
instance of: scholarly article
title: A lower bound for scheduling mechanisms
zbMATH Open document ID: 1183.68105
author: George Christodoulou
author: Elias Koutsoupias
author: Angelina Vidali
published in: Algorithmica
publication date: 2009-10-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5620135
zbMATH Keywords: algorithmic mechanism design
zbMATH Keywords: scheduling unrelated machines
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: s00453-008-9165-3
OpenAlex ID: W3136264843
cites work: STACS 2005
cites work: Q4471296
cites work: Approximation techniques for utilitarian mechanism design
cites work: Mechanism Design for Fractional Scheduling on Unrelated Machines
cites work: Q2934711
cites work: Approximation algorithms for combinatorial auctions with complement-free bidders
cites work: Truthful randomized mechanisms for combinatorial auctions
cites work: Q3002852
cites work: Algorithms – ESA 2005
cites work: Q3452917
cites work: Truthful mechanism design for multidimensional scheduling via cycle monotonicity
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Q2934709
cites work: Optimal Auction Design
cites work: Algorithmic mechanism design (extended abstract)
cites work: Algorithmic mechanism design
cites work: Q3867502
DOI: 10.1007/S00453-008-9165-3
description: scientific article; zbMATH DE number 5620135