Sciweavers

6 search results - page 1 / 2
» Competitive Repeated Allocation without Payments
Sort
View
WINE
2009
Springer
182views Economy» more  WINE 2009»
14 years 2 months ago
Competitive Repeated Allocation without Payments
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...
Mingyu Guo, Vincent Conitzer, Daniel M. Reeves
ATAL
2010
Springer
13 years 8 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer
AAAI
2010
13 years 9 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
MOBICOM
2009
ACM
14 years 1 months ago
Revenue maximization and distributed power allocation in cognitive radio networks
Cognitive radio is an enabling technology that allows unlicensed users to opportunistically access the spectrum in order to enhance the spectrum efficiency. In this paper, we cons...
Shaolei Ren, Mihaela van der Schaar
WWW
2010
ACM
14 years 2 months ago
Money, glory and cheap talk: analyzing strategic behavior of contestants in simultaneous crowdsourcing contests on TopCoder.com
Crowdsourcing is a new Web phenomenon, in which a firm takes a function once performed in-house and outsources it to a crowd, usually in the form of an open contest. Designing ef...
Nikolay Archak