On profit-maximizing envy-free pricing
From MaRDI portal
Publication:2921790
zbMATH Open1297.91072MaRDI QIDQ2921790FDOQ2921790
Authors: Jason D. Hartline, Anna R. Karlin, David Kempe, Frank McSherry, Venkatesan Guruswami, Claire Kenyon 
Publication date: 13 October 2014
Recommendations
Consumer behavior, demand theory (91B42) Microeconomic theory (price theory and economic markets) (91B24)
Cited In (82)
- Tight Revenue Gaps Among Simple Mechanisms
- Envy-free matchings in bipartite graphs and their applications to fair division
- Ad Exchange: Envy-Free Auctions with Mediators
- Pricing on paths: a PTAS for the highway problem
- On multi-demand knapsack pricing
- Recent studies of agent incentives in Internet resource allocation and pricing
- Mixed-integer formulations for the capacitated rank pricing problem with envy
- Approximate competitive equilibrium with generic budget
- Competitive location and pricing on a line with metric transportation costs
- On envy-free perfect matching
- Anonymous Auctions Maximizing Revenue
- Optimal deterministic auctions with correlated priors
- On complexity classes of envy-free pricing problems: a short survey
- Title not available (Why is that?)
- Reducing mechanism design to algorithm design via machine learning
- On stackelberg pricing with computationally bounded customers
- The power of randomness in Bayesian optimal mechanism design
- The rank pricing problem: models and branch-and-cut algorithms
- On the complexity of the highway problem
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- On revenue maximization with sharp multi-unit demands
- Graph pricing with limited supply
- On Multi-dimensional Envy-Free Mechanisms
- On core-selecting and core-competitive mechanisms for binary single-parameter auctions
- Envy-free pricing in multi-item markets
- Competitive Equilibrium with Indivisible Goods and Generic Budgets
- Title not available (Why is that?)
- The Stackelberg minimum spanning tree game
- Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets
- A polyhedral study of the network pricing problem with connected toll arcs
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets
- Efficiency and complexity of price competition among single-product vendors
- Approximation algorithms for the max-buying problem with limited supply
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- Walrasian pricing in multi-unit auctions
- Models and algorithms for the product pricing with single-minded customers requesting bundles
- On envy-free revenue approximation for combinatorial buyers with budgets
- New formulations and valid inequalities for a bilevel pricing problem
- Price strategy implementation
- Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Combinatorial Walrasian Equilibrium
- Offline and online algorithms for single-minded selling problem
- Pricing loss leaders can be hard
- Pricing lotteries
- Envy-Free Pricing in Multi-item Markets
- The complexity of optimal multidimensional pricing for a unit-demand buyer
- Auctions with online supply
- Location, pricing and the problem of Apollonius
- Online pricing for bundles of multiple items
- A hybrid approach to the solution of a pricing model with continuous demand segmentation
- Envy-free pricing with general supply constraints for unit demand consumers
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
- On fair price discrimination in multi-unit markets
- Maximum utility product pricing models and algorithms based on reservation price
- The price of envy-freeness in machine scheduling
- A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph
- Pricing commodities
- The Envy-Free Pricing Problem and Unit-Demand Markets
- Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets
- Stackelberg network pricing games
- Fair by design: multidimensional envy-free mechanisms
- Efficient heuristic algorithms for maximum utility product pricing problems
- On social envy-freeness in multi-unit markets
- A survey on mixed-integer programming techniques in bilevel optimization
- Pricing bridges to cross a river
- Automated design of revenue-maximizing combinatorial auctions
- The balloon popping problem revisited: lower and upper bounds
- Stackelberg network pricing is hard to approximate
- Uniform Budgets and the Envy-Free Pricing Problem
- Approximating the revenue maximization problem with sharp demands
- Optimal pricing of capacitated networks
- The power of fair pricing mechanisms
- The power of fair pricing mechanisms
- On the complexity of a bundle pricing problem
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
- Online pricing for multi-type of items
- Optimal bundle pricing with monotonicity constraint
- Title not available (Why is that?)
- Recent studies of agent incentives in internet resource allocation and pricing
- Title not available (Why is that?)
This page was built for publication: On profit-maximizing envy-free pricing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921790)
