Sciweavers

20 search results - page 1 / 4
» Using value queries in combinatorial auctions
Sort
View
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
FC
2003
Springer
133views Cryptology» more  FC 2003»
13 years 9 months ago
Secure Generalized Vickrey Auction Using Homomorphic Encryption
Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a com...
Koutarou Suzuki, Makoto Yokoo
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 2 days ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák