1034 search results - page 90 / 207 » Competitive generalized auctions |
108
Voted
MIDDLEWARE
2007
Springer
15 years 6 months ago
2007
Springer
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
133
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
AAAI
2008
15 years 2 months ago
2008
A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness ...
83
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
133
Voted
WINE
2010
Springer
14 years 10 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...