Sciweavers

224 search results - page 1 / 45
» Auctions with Severely Bounded Communication
Sort
View
FOCS
2002
IEEE
13 years 9 months ago
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
Liad Blumrosen, Noam Nisan
ESA
2003
Springer
100views Algorithms» more  ESA 2003»
13 years 10 months ago
Multi-player and Multi-round Auctions with Severely Bounded Communication
We study auctions in which bidders have severe constraints on the size of messages they are allowed to send to the auctioneer. In such auctions, each bidder has a set of k possible...
Liad Blumrosen, Noam Nisan, Ilya Segal
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 6 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
INFOCOM
2012
IEEE
11 years 7 months ago
Truthful spectrum auction design for secondary networks
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
Yuefei Zhu, Baochun Li, Zongpeng Li
IIWAS
2007
13 years 6 months ago
Implementing Semantic Interoperability in Electronic Auctions
Electronic marketplaces can provide several types of business processes depending upon their target audience. A form of such processes is electronic auction. It is a system for ac...
Juha Puustjärvi