Pages that link to "Item:Q3167386"
From MaRDI portal
The following pages link to Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply (Q3167386):
Displaying 16 items.
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
- Graph pricing with limited supply (Q832882) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- On fair price discrimination in multi-unit markets (Q2046039) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Online pricing for multi-type of items (Q2257292) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- On envy-free perfect matching (Q2414450) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare (Q3448773) (← links)
- (Q5005149) (← links)
- (Q5075798) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)
