227 search results - page 34 / 46 » Combinatorial Auctions with Budgets |
99
Voted
ATAL
2010
Springer
15 years 1 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...
101
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
110
Voted
SIGECOM
2008
ACM
15 years 11 days ago
2008
ACM
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
113
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
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...
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...