Improved lower bounds for non-utilitarian truthfulness
type: Item
instance of: scholarly article
title: Improved lower bounds for non-utilitarian truthfulness
zbMATH Open document ID: 1206.68065
author: Iftah Gamzu
published in: Theoretical Computer Science
publication date: 2011-02-21T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5853771
zbMATH Keywords: algorithmic mechanism design
zbMATH Keywords: non-utilitarian inapproximability
zbMATH Keywords: inter-domain routing problem
zbMATH Keywords: unrelated machines scheduling problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.05.012
OpenAlex ID: W2161456923
cites work: Convex programming for scheduling unrelated parallel machines
cites work: Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
cites work: Mechanism Design for Fractional Scheduling on Unrelated Machines
cites work: Q2934711
cites work: Truthful randomized mechanisms for combinatorial auctions
cites work: A BGP-based mechanism for lowest-cost routing
cites work: Incentives in Teams
cites work: A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Q4910748
cites work: Q2934709
cites work: Algorithmic mechanism design
cites work: An approximation algorithm for the generalized assignment problem
DOI: 10.1016/J.TCS.2009.05.012
description: scientific article; zbMATH DE number 5853771