Results 1  10
of
682
Sequential Item Pricing for Unlimited Supply
 In Proceedings of the Workshop on Internet and Network Economics
, 2010
"... ..."
From Optimal Limited to Unlimited Supply Auctions
 In EC
, 2005
"... We investigate the class of singleround, sealedbid auctions for a set of identical items to bidders who each desire one unit. We adopt the worstcase competitive framework defined by [9, 5] that compares the profit of an auction to that of an optimal singleprice sale of least two items. In this p ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
. In this paper, we first derive an optimal auction for three items, answering an open question from [8]. Second, we show that the form of this auction is independent of the competitive framework used. Third, we propose a schema for converting a given limitedsupply auction into an unlimited supply auction
SingleMinded Unlimited Supply Pricing on Sparse Instances
 In Proceedings of the 17th ACMSIAM Symposium on Discrete Algorithms
, 2006
"... Abstract We deal with the problem of finding profitmaximizingprices for a finite number of distinct goods, assuming that ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
Abstract We deal with the problem of finding profitmaximizingprices for a finite number of distinct goods, assuming that
From Optimal Limited To Unlimited Supply Auctions
"... ABSTRACT We investigate the class of singleround, sealedbid auctions for aset of identical items to bidders who each desire one unit. We adopt ..."
Abstract
 Add to MetaCart
ABSTRACT We investigate the class of singleround, sealedbid auctions for aset of identical items to bidders who each desire one unit. We adopt
Single price mechanisms for revenue maximization in unlimited supply combinatorial auctions
, 2007
"... In this note we generalize a result of Guruswami et. al [7], showing that in unlimitedsupply combinatorial auctions, a surprisingly simple mechanism that offers the same price for each item achieves revenue within a logarithmic factor of the total social welfare for bidders with general valuation f ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
In this note we generalize a result of Guruswami et. al [7], showing that in unlimitedsupply combinatorial auctions, a surprisingly simple mechanism that offers the same price for each item achieves revenue within a logarithmic factor of the total social welfare for bidders with general valuation
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
"... We consider profit maximization pricing problems, where we are given a set of m customers and a set of n items. Each customer c is associated with a subset Sc ⊆ [n] of items of interest, together with a budget Bc, and we assume that there is an unlimited supply of each item. Once the prices are fixe ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We consider profit maximization pricing problems, where we are given a set of m customers and a set of n items. Each customer c is associated with a subset Sc ⊆ [n] of items of interest, together with a budget Bc, and we assume that there is an unlimited supply of each item. Once the prices
Abstract SingleMinded Unlimited Supply Pricing on Sparse Instances
"... We deal with the problem of finding profitmaximizing prices for a finite number of distinct goods, assuming that of each good an unlimited number of copies is available, or that goods can be reproduced at no cost (e.g., digital goods). Consumers specify subsets of the goods and the maximum prices t ..."
Abstract
 Add to MetaCart
We deal with the problem of finding profitmaximizing prices for a finite number of distinct goods, assuming that of each good an unlimited number of copies is available, or that goods can be reproduced at no cost (e.g., digital goods). Consumers specify subsets of the goods and the maximum prices
Abstract SingleMinded Unlimited Supply Pricing on Sparse Instances
"... We deal with the problem of finding profitmaximizing prices for a finite number of distinct goods, assuming that of each good an unlimited number of copies is available, or that goods can be reproduced at no cost (e.g., digital goods). Consumers specify subsets of the goods and the maximum prices t ..."
Abstract
 Add to MetaCart
We deal with the problem of finding profitmaximizing prices for a finite number of distinct goods, assuming that of each good an unlimited number of copies is available, or that goods can be reproduced at no cost (e.g., digital goods). Consumers specify subsets of the goods and the maximum prices
Abstract SingleMinded Unlimited Supply Pricing on Sparse Instances
"... We deal with the problem of finding profitmaximizing prices for a finite number of distinct goods, assuming that of each good an unlimited number of copies is available, or that goods can be reproduced at no cost (e.g., digital goods). Consumers specify subsets of the goods and the maximum prices t ..."
Abstract
 Add to MetaCart
We deal with the problem of finding profitmaximizing prices for a finite number of distinct goods, assuming that of each good an unlimited number of copies is available, or that goods can be reproduced at no cost (e.g., digital goods). Consumers specify subsets of the goods and the maximum prices
The Dubai Initiative Working Paper Economic Growth with Unlimited Supplies of Foreign Labor Tarek Coury and Mohamed LahouelEconomic Growth with Unlimited Supplies of Foreign Labor: Theory and Some Evidence from the GCC
"... We develop a modified version of the standard Solow and Ramsey growth models suited for countries with high proportions of foreign workers: firms hire foreign workers who are assumed to send a proportion of their wages as remittances. The paper shows that as the (foreign) supply of labor becomes mor ..."
Abstract
 Add to MetaCart
We develop a modified version of the standard Solow and Ramsey growth models suited for countries with high proportions of foreign workers: firms hire foreign workers who are assumed to send a proportion of their wages as remittances. The paper shows that as the (foreign) supply of labor becomes
Results 1  10
of
682