Sciweavers

549 search results - page 40 / 110
» Computational Bundling for Auctions
Sort
View
AMEC
2003
Springer
15 years 5 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
EOR
2011
140views more  EOR 2011»
14 years 3 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
DALT
2008
Springer
15 years 1 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
INFOCOM
2011
IEEE
14 years 3 months ago
Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets
Abstract—Secondary spectrum access is emerging as a promising approach for mitigating the spectrum scarcity in wireless networks. Coordinated spectrum access for secondary users ...
Ajay Gopinathan, Zongpeng Li, Chuan Wu
WLP
2005
Springer
15 years 5 months ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...