Sciweavers

60 search results - page 2 / 12
» From optimal limited to unlimited supply auctions
Sort
View
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 3 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
13 years 11 months ago
Truthful Online Auctions for Pricing Peer-to-Peer Services
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
Po-An Chen, Tyng-Ruey Chuang
LATIN
2010
Springer
13 years 10 months ago
The Power of Fair Pricing Mechanisms
We explore the revenue capabilities of truthful, monotone (“fair”) allocation and pricing functions for resource-constrained auction mechanisms within a general framework that ...
Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron...
WIAS
2008
85views more  WIAS 2008»
13 years 5 months ago
Optimal combinatorial electricity markets
The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage...
Yoseba K. Penya, Nicholas R. Jennings
JCSS
2008
138views more  JCSS 2008»
13 years 5 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...