Publication:2921790

Jason D. Hartline, Anna R. Karlin, David Kempe, Frank McSherry, Venkatesan Guruswami, Claire M. Kenyon

Publication date: 13 October 2014

91B24: Microeconomic theory (price theory and economic markets)

91B42: Consumer behavior, demand theory

Related Items

On stackelberg pricing with computationally bounded customers, Unnamed Item, Unnamed Item, Unnamed Item, Competitive Equilibrium with Indivisible Goods and Generic Budgets, On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer, Tight Revenue Gaps Among Simple Mechanisms, Optimal pricing of capacitated networks, Pricing bridges to cross a river, Envy-free pricing in multi-item markets, Unnamed Item, On revenue maximization with sharp multi-unit demands, Efficient heuristic algorithms for maximum utility product pricing problems, An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph, Approximating the revenue maximization problem with sharp demands, Maximum utility product pricing models and algorithms based on reservation price, Pricing commodities, The Stackelberg minimum spanning tree game, The balloon popping problem revisited: lower and upper bounds, On the complexity of a bundle pricing problem, On the complexity of the highway problem, Price strategy implementation, Online pricing for bundles of multiple items, A hybrid approach to the solution of a pricing model with continuous demand segmentation, On core-selecting and core-competitive mechanisms for binary single-parameter auctions, Graph pricing with limited supply, The price of envy-freeness in machine scheduling, New formulations and valid inequalities for a bilevel pricing problem, Walrasian equilibrium: Hardness, approximations and tractable instances, Optimal bundle pricing with monotonicity constraint, Reducing mechanism design to algorithm design via machine learning, The complexity of optimal multidimensional pricing for a unit-demand buyer, Location, pricing and the problem of Apollonius, The rank pricing problem: models and branch-and-cut algorithms, Recent studies of agent incentives in internet resource allocation and pricing, The envy-free pricing problem, unit-demand markets and connections with the network pricing problem, Approximation algorithms for the max-buying problem with limited supply, Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting, Models and algorithms for the product pricing with single-minded customers requesting bundles, On envy-free revenue approximation for combinatorial buyers with budgets, On fair price discrimination in multi-unit markets, Recent studies of agent incentives in Internet resource allocation and pricing, Offline and online algorithms for single-minded selling problem, Pricing lotteries, Online pricing for multi-type of items, Competitive location and pricing on a line with metric transportation costs, Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments, On social envy-freeness in multi-unit markets, Auctions with online supply, Fair by design: multidimensional envy-free mechanisms, The power of randomness in Bayesian optimal mechanism design, Efficiency and complexity of price competition among single-product vendors, On envy-free perfect matching, Stackelberg network pricing games, The power of fair pricing mechanisms, Optimal deterministic auctions with correlated priors, Envy-free pricing with general supply constraints for unit demand consumers, Pricing loss leaders can be hard, Mixed-integer formulations for the capacitated rank pricing problem with envy, Approximate competitive equilibrium with generic budget, Automated Design of Revenue-Maximizing Combinatorial Auctions, Pricing on Paths: A PTAS for the Highway Problem, Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets, Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets, Anonymous Auctions Maximizing Revenue, Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets, A polyhedral study of the network pricing problem with connected toll arcs, Stackelberg network pricing is hard to approximate, The Envy-Free Pricing Problem and Unit-Demand Markets, Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare, Combinatorial Walrasian Equilibrium, Ad Exchange: Envy-Free Auctions with Mediators