197 search results - page 30 / 40 » Bidding and allocation in combinatorial auctions |
101
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
SIGECOM
2008
ACM
14 years 10 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
CIA
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. In this paper we address a model of self interested information agents competing to perform tasks. The agents are situated in an uncertain environment while different tas...
AMMA
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT: We examine an environment where goods and privately informed buyers arrive stochastically to a market. A seller in this setting faces a sequential allocation problem with...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...