The following pages link to Combination can be hard (Q3581529):
Displayed 12 items.
- Pricing commodities (Q627117) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- Price strategy implementation (Q709178) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- The Parameterized Complexity of the Unique Coverage Problem (Q5387796) (← links)
- Envy-free pricing in multi-item markets (Q5501961) (← links)
- (Q5743433) (← links)