Sciweavers

9 search results - page 1 / 2
» Envy-Free Allocations for Budgeted Bidders
Sort
View
WINE
2009
Springer
117views Economy» more  WINE 2009»
13 years 11 months ago
Envy-Free Allocations for Budgeted Bidders
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...
David Kempe, Ahuva Mu'alem, Mahyar Salek
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
13 years 11 months 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
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
FOCS
2008
IEEE
13 years 11 months ago
Multi-unit Auctions with Budget Limits
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...
Shahar Dobzinski, Ron Lavi, Noam Nisan
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 4 months ago
A Truthful Mechanism for Offline Ad Slot Scheduling
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, M...