Sciweavers

197 search results - page 27 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
ACMICEC
2003
ACM
144views ECommerce» more  ACMICEC 2003»
15 years 3 months ago
Security model for a multi-agent marketplace
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
Ashutosh Jaiswal, Yongdae Kim, Maria L. Gini
ATAL
2004
Springer
15 years 1 months ago
Anonymous Pricing of Efficient Allocations in Combinatorial Economies
Auctions and exchanges are important coordination mechanisms for multiagent systems. Most multi-good markets are combinatorial in that the agents have preferences over bundles of ...
Wolfram Conen, Tuomas Sandholm
ICMAS
2000
14 years 11 months ago
Assessing Usage Patterns to Improve Data Allocation via Auctions
The data allocation problem in incomplete information environments consisting of self-motivated servers responding to users' queries is considered. Periodically, the servers ...
Rina Azoulay-Schwartz, Sarit Kraus
STOC
2005
ACM
146views Algorithms» more  STOC 2005»
15 years 10 months ago
Approximation algorithms for combinatorial auctions with complement-free bidders
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
Shahar Dobzinski, Noam Nisan, Michael Schapira
76
Voted
FC
2004
Springer
105views Cryptology» more  FC 2004»
15 years 3 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