9 search results - page 2 / 2 » Envy-Free Allocations for Budgeted Bidders |
IAT
2008
IEEE
13 years 11 months ago
2008
IEEE
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to o...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...