Sciweavers

Share
CVPR
2012
IEEE
7 years 2 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
AMAI
2010
Springer
8 years 9 months ago
Comparing multiagent systems research in combinatorial auctions and voting
In a combinatorial auction, a set of resources is for sale, and agents can bid on subsets of these resources. In a voting setting, the agents decide among a set of alternatives by...
Vincent Conitzer
AI
2002
Springer
8 years 12 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
CORR
2010
Springer
147views Education» more  CORR 2010»
9 years 4 days ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang
EUMAS
2006
9 years 1 months ago
Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goods to sell, and for transformations of goods. One such transformation can be se...
Jesús Cerquides, Ulle Endriss, Andrea Giova...
SIGECOM
2000
ACM
227views ECommerce» more  SIGECOM 2000»
9 years 4 months ago
Combinatorial auctions for supply chain formation
Supply chain formation presents dif´Čücult coordination issues for distributed negotiation protocols. Agents must simultaneously negotiate production relationships at multiple lev...
William E. Walsh, Michael P. Wellman, Fredrik Ygge
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
9 years 5 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
FC
2003
Springer
133views Cryptology» more  FC 2003»
9 years 5 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
FC
2004
Springer
105views Cryptology» more  FC 2004»
9 years 5 months ago
Secure Generalized Vickrey Auction without Third-party Servers
This paper presents a secure Generalized Vickrey Auction (GVA) scheme that does not require third-party servers, i.e., the scheme is executed only by an auctioneer and bidders. Com...
Makoto Yokoo, Koutarou Suzuki
IPPS
2005
IEEE
9 years 5 months ago
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
In this paper, we introduce the combinatorial auction model for resource management in grids. We propose a combinatorial auction-based resource allocation protocol in which a user...
Anubhav Das, Daniel Grosu
books