Sciweavers

549 search results - page 75 / 110
» Computational Bundling for Auctions
Sort
View
ATAL
2010
Springer
13 years 11 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
MAGS
2006
79views more  MAGS 2006»
13 years 9 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...
JETAI
2007
141views more  JETAI 2007»
13 years 9 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan