Results 1  10
of
189
On ProfitMaximizing Envyfree Pricing
"... We study the problem of pricing items for sale to consumers so as to maximize the seller’s revenue. We assume that for each consumer, we know the maximum amount he would be willing to pay for each bundle of items, and want to find pricings of the items with corresponding allocations that maximize se ..."
Abstract

Cited by 122 (12 self)
 Add to MetaCart
among a selection they are interested in, and singleminded consumers, who want to buy one particular subset, but only if they can afford it. We show that computing envyfree prices to maximize the seller’s revenue is APXhard in both of these cases, and give a logarithmic approximation algorithm
Abstract On ProfitMaximizing Envyfree Pricing
"... We study the problem of pricing items for sale to consumers so as to maximize the seller’s revenue. We assume that for each consumer, we know the maximum amount he would be willing to pay for each bundle of items, and want to find pricings of the items with corresponding allocations that maximize se ..."
Abstract
 Add to MetaCart
among a selection they are interested in, and singleminded consumers, who want to buy one particular subset, but only if they can afford it. We show that computing envyfree prices to maximize the seller’s revenue is APXhard in both of these cases, and give a logarithmic approximation algorithm
Uniform budgets and the envyfree pricing problem
 In Proceedings of the 35th International Colloquium on Automata, Languages and Programming
, 2008
"... We consider the unitdemand minbuying pricing problem, in which we want to compute revenue maximizing prices for a set of products P assuming that each consumer from a set of consumer samples C will purchase her cheapest affordable product once prices are fixed. We focus on the special uniformbudg ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
budget case, in which every consumer has only a single nonzero budget for some set of products. This constitutes a special case also of the unitdemand envyfree pricing problem. We show that, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness
Envyfree Pricing with General Supply Constraints for Unit Demand Consumers
 JOURNAL OF COMPOUTER SCIENCE AND TECHNOLOGY
, 2011
"... The envyfree pricing problem can be stated as finding a pricing and allocation scheme in which each consumer is allocated a set of items that maximize her utility under the pricing. The goal is to maximize seller revenue. We study the problem with general supply constraints which are given as an in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The envyfree pricing problem can be stated as finding a pricing and allocation scheme in which each consumer is allocated a set of items that maximize her utility under the pricing. The goal is to maximize seller revenue. We study the problem with general supply constraints which are given
EnvyFree Pricing in Multiitem Markets
, 2010
"... In this paper, we study revenue maximizing envyfree pricing in multiitem markets: There are m indivisible items and n potential buyers where each buyer is interested in acquiring one item. The goal is to determine allocations (a matching between buyers and items) and prices of all items to maximiz ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper, we study revenue maximizing envyfree pricing in multiitem markets: There are m indivisible items and n potential buyers where each buyer is interested in acquiring one item. The goal is to determine allocations (a matching between buyers and items) and prices of all items
Optimal envyfree pricing with metric substitutability
 In ACM Conference on Electronic Commerce
"... We study the envyfree pricing problem faced by a profit maximizing seller when there is metric substitutability among the items — consumer i’s value for item j is vi − ci,j, and the substitution costs, {ci,j}, form a metric. Our model is motivated from the observation that sellers often sell the sa ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We study the envyfree pricing problem faced by a profit maximizing seller when there is metric substitutability among the items — consumer i’s value for item j is vi − ci,j, and the substitution costs, {ci,j}, form a metric. Our model is motivated from the observation that sellers often sell
Revenue Maximizing Envyfree Multiunit Auctions with Budgets
"... We study envyfree (EF) mechanisms for multiunit auctions with budgeted agents that approximately maximize revenue. In an EF auction, prices are set so that every bidder receives a bundle that maximizes her utility amongst all bundles; We show that the problem of revenuemaximizing EF auctions is N ..."
Abstract
 Add to MetaCart
We study envyfree (EF) mechanisms for multiunit auctions with budgeted agents that approximately maximize revenue. In an EF auction, prices are set so that every bidder receives a bundle that maximizes her utility amongst all bundles; We show that the problem of revenuemaximizing EF auctions
Electronic Colloquium on Computational Complexity, Report No. 150 (2006) Towards Hardness of EnvyFree Pricing
"... We consider the envyfree pricing problem, in which we want to compute revenue maximizing prices for a set of products P assuming that each consumer from a set of consumer samples C will buy the product maximizing her personal utility, i.e., the difference between her respective budget and the produ ..."
Abstract
 Add to MetaCart
We consider the envyfree pricing problem, in which we want to compute revenue maximizing prices for a set of products P assuming that each consumer from a set of consumer samples C will buy the product maximizing her personal utility, i.e., the difference between her respective budget
Optimal Bundle Pricing for Homogeneous Items
"... We consider a revenue maximization problem where we are selling a set ofm items, each of which available in a certain quantity (possibly unlimited) to a set of n bidders. Bidders are single minded, that is, each bidder requests exactly one subset, or bundle of items. Each bidder has a valuation fo ..."
Abstract
 Add to MetaCart
for the requested bundle that we assume to be known to the seller. The task is to find an envyfree pricing such as to maximize the revenue of the seller. We derive several complexity results and algorithms for several variants of this pricing problem. In fact, the settings that we consider address problems where
An overview of pricing models for revenue management
 MANUFACTURING AND SERVICE OPERATIONS MANAGEMENT
, 2003
"... In this paper, we examine the research and results of dynamic pricing policies and their relation to revenue management. The survey is based on a generic revenue management problem in which a perishable and nonrenewable set of resources satisfy stochastic pricesensitive demand processes over a fini ..."
Abstract

Cited by 96 (3 self)
 Add to MetaCart
In this paper, we examine the research and results of dynamic pricing policies and their relation to revenue management. The survey is based on a generic revenue management problem in which a perishable and nonrenewable set of resources satisfy stochastic pricesensitive demand processes over a
Results 1  10
of
189