199 search results - page 29 / 40 » Auctions with Untrustworthy Bidders |
ATAL
2006
Springer
15 years 2 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:...
WWW
2008
ACM
15 years 11 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
73
Voted
ECAI
2008
Springer
15 years 27 days ago
2008
Springer
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
109
click to vote
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
—Dynamic spectrum allocation has proven promising for mitigating the spectrum scarcity problem. In this model, primary users lease chunks of under-utilized spectrum to secondary ...
FOCS
2005
IEEE
15 years 4 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...