Sciweavers

35 search results - page 4 / 7
» Limits on the Social Welfare of Maximal-In-Range Auction Mec...
Sort
View
INFOCOM
2012
IEEE
12 years 1 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
14 years 4 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 8 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
MONET
2006
107views more  MONET 2006»
13 years 10 months ago
Auction-Based Spectrum Sharing
We study auction mechanisms for sharing spectrum among a group of users, subject to a constraint on the interference temperature at a measurement point. The users access the channe...
Jianwei Huang, Randall Berry, Michael L. Honig
ATAL
2003
Springer
14 years 4 months ago
Miscomputing ratio: social cost of selfish computing
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
Kate Larson, Tuomas Sandholm