On complexity classes of envy-free pricing problems: a short survey
From MaRDI portal
Publication:6660081
DOI10.1007/S43069-024-00373-1MaRDI QIDQ6660081
Alcides de C. Amorim Neto, Juan G. Colonna, Marcos Salvatierra, Mario Jun. Salvatierra
Publication date: 10 January 2025
Published in: SN Operations Research Forum (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On revenue maximization with sharp multi-unit demands
- On the complexity of the highway problem
- The strong perfect graph theorem
- A pricing problem under Monge property
- Optimal bundle pricing with monotonicity constraint
- The ellipsoid method and its consequences in combinatorial optimization
- On the complexity of approximating the independent set problem
- Some simplified NP-complete graph problems
- Some APX-completeness results for cubic graphs
- Perspectives of Monge properties in optimization
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- On fair price discrimination in multi-unit markets
- On envy-free perfect matching
- Tariff optimization in networks
- On profit-maximizing envy-free pricing
- Optimal Envy-Free Pricing with Metric Substitutability
- Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
- On a routing problem
- Assignment Problems and the Location of Economic Activities
- Combinatorial Walrasian Equilibrium
- Single-minded unlimited supply pricing on sparse instances
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Optimal pricing of capacitated networks
- Algorithms and Data Structures
- Algorithmic Game Theory
- Pricing bridges to cross a river
- Envy-free pricing in multi-item markets
- The dense \(k\)-subgraph problem
- Quadratic Regularization of Bilevel Pricing Problems and Application to Electricity Retail Markets
This page was built for publication: On complexity classes of envy-free pricing problems: a short survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660081)
