Sciweavers

149 search results - page 11 / 30
» On Mechanism Design without Payments for Throughput Maximiza...
Sort
View
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
14 years 1 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
2006
Springer
14 years 5 days ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes
AAAI
2012
11 years 10 months ago
Optimal Auctions for Spiteful Bidders
Designing revenue-optimal auctions for various settings is perhaps the most important, yet sometimes most elusive, problem in mechanism design. Spiteful bidders have been intensel...
Pingzhong Tang, Tuomas Sandholm
IPPS
2007
IEEE
14 years 2 months ago
Table-lookup based Crossbar Arbitration for Minimal-Routed, 2D Mesh and Torus Networks
Crossbar arbitration—which determines the allocation of output ports to packets in the input queues—is a performance-critical stage in the overall performance of routers for i...
Daeho Seo, Mithuna Thottethodi
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
14 years 8 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare