364 search results - page 28 / 73 » Mechanisms for Multi-Unit Auctions |
107
click to vote
SIGECOM
2004
ACM
15 years 7 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
116
Voted
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
117
click to vote
WWW
2009
ACM
16 years 2 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
117
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
122
click to vote
TASE
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...