Sciweavers

40 search results - page 7 / 8
» On characterizations of truthful mechanisms for combinatoria...
Sort
View
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
14 years 10 days ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
ICPP
2008
IEEE
14 years 5 days ago
An Incentive-Compatible Mechanism for Scheduling Non-Malleable Parallel Jobs with Individual Deadlines
We design an incentive-compatible mechanism for scheduling n non-malleable parallel jobs on a parallel system comprising m identical processors. Each job is owned by a selfish us...
Thomas E. Carroll, Daniel Grosu
AIPS
2003
13 years 7 months ago
Economically Augmented Job Shop Scheduling
We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its signific...
Wolfram Conen
AIR
2004
111views more  AIR 2004»
13 years 5 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
IOR
2011
96views more  IOR 2011»
12 years 9 months ago
An Ascending Vickrey Auction for Selling Bases of a Matroid
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
Sushil Bikhchandani, Sven de Vries, James Schummer...