Recommendations
Cited in
(91)- Reducing mechanism design to algorithm design via machine learning
- On the complexity of the highway problem
- The rank pricing problem: models and branch-and-cut algorithms
- The power of randomness in Bayesian optimal mechanism design
- On revenue maximization with sharp multi-unit demands
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- Graph pricing with limited supply
- Pricing problems with buyer preselection
- Envy-free pricing in large markets: approximating revenue and welfare
- Combinatorial Walrasian equilibrium
- 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
- scientific article; zbMATH DE number 7204414 (Why is no real title available?)
- The Stackelberg minimum spanning tree game
- Envy-free matchings in bipartite graphs and their applications to fair division
- A polyhedral study of the network pricing problem with connected toll arcs
- Efficiency and complexity of price competition among single-product vendors
- Approximation algorithms for the max-buying problem with limited supply
- On envy-free Pareto efficient pricing
- The envy-free pricing problem and unit-demand markets
- Packing cars into narrow roads: PTASs for limited supply highway
- On the hardness of pricing loss-leaders
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- Revenue maximizing envy-free fixed-price auctions with budgets
- Envy-free revenue approximation for asymmetric buyers with budgets
- Revenue maximizing envy-free pricing in matching markets with budgets
- Walrasian pricing in multi-unit auctions
- Pricing problems with buyer preselection
- Optimal envy-free pricing with metric substitutability
- Pricing on paths: a PTAS for the highway problem
- 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
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Sublogarithmic approximation for tollbooth pricing on a cactus
- Offline and online algorithms for single-minded selling problem
- Tight revenue gaps among simple mechanisms
- Pricing lotteries
- Pricing loss leaders can be hard
- The complexity of optimal multidimensional pricing for a unit-demand buyer
- Envy-Free Pricing in Multi-item Markets
- Location, pricing and the problem of Apollonius
- Auctions with online supply
- Anonymous auctions maximizing revenue
- Online pricing for bundles of multiple items
- On Stackelberg pricing with computationally bounded customers
- A hybrid approach to the solution of a pricing model with continuous demand segmentation
- On multi-demand knapsack pricing
- 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
- Recent studies of agent incentives in Internet resource allocation and pricing
- The price of envy-freeness in machine scheduling
- Competitive equilibrium with indivisible goods and generic budgets
- A note on fairness and personalised pricing
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph
- A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs
- Pricing commodities
- 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
- Stackelberg network pricing games
- Efficient heuristic algorithms for maximum utility product pricing problems
- Fair by design: multidimensional envy-free mechanisms
- On envy-free perfect matching
- 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 unit-demand envy-free pricing problem applied to the sports entertainment industry
- The balloon popping problem revisited: lower and upper bounds
- Optimal deterministic auctions with correlated priors
- An efficient alternative strategy for finding prices in envy-free perfect matchings
- Stackelberg network pricing is hard to approximate
- Uniform Budgets and the Envy-Free Pricing Problem
- Approximating the revenue maximization problem with sharp demands
- Social welfare and profit maximization from revealed preferences
- Optimal pricing of capacitated networks
- On complexity classes of envy-free pricing problems: a short survey
- On the complexity of a bundle pricing problem
- The power of fair pricing mechanisms
- The power of fair pricing mechanisms
- Online pricing for multi-type of items
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
- Optimal bundle pricing with monotonicity constraint
- Recent studies of agent incentives in internet resource allocation and pricing
- Ad exchange: envy-free auctions with mediators
- Pricing to maximize revenue and welfare simultaneously in large markets
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)
