Sciweavers

50 search results - page 4 / 10
» Fairness in Combinatorial Auctioning Systems
Sort
View
MONET
2006
107views more  MONET 2006»
14 years 9 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
ECAI
2008
Springer
14 years 11 months ago
Agents Preferences in Decentralized Task Allocation
The ability to express preferences for specific tasks in multi-agent auctions is an important element for potential users who are considering to use such auctioning systems. This p...
Mark Hoogendoorn, Maria L. Gini
HICSS
2005
IEEE
134views Biometrics» more  HICSS 2005»
15 years 3 months ago
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
WINE
2005
Springer
182views Economy» more  WINE 2005»
15 years 3 months ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...
ATAL
2010
Springer
14 years 11 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...