Sciweavers

75 search results - page 3 / 15
» Approximately Efficient Online Mechanism Design
Sort
View
HICSS
2007
IEEE
141views Biometrics» more  HICSS 2007»
13 years 11 months ago
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
Dirk Neumann, Björn Schnizler, Ilka Weber, Ch...
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
ATAL
2010
Springer
13 years 6 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
DASFAA
2005
IEEE
191views Database» more  DASFAA 2005»
13 years 11 months ago
An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
WWW
2007
ACM
14 years 6 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...