Pages that link to "Item:Q3583426"

The following pages link to Single-minded unlimited supply pricing on sparse instances (Q3583426):

Displaying 26 items.

• On revenue maximization with sharp multi-unit demands (Q266046) (← links)
• An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
• Pricing commodities (Q627117) (← links)
• The Stackelberg minimum spanning tree game (Q627533) (← links)
• On the complexity of the highway problem (Q690481) (← links)
• Price strategy implementation (Q709178) (← links)
• Graph pricing with limited supply (Q832882) (← links)
• Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
• Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
• Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
• On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
• On fair price discrimination in multi-unit markets (Q2046039) (← links)
• Online pricing for multi-type of items (Q2257292) (← links)
• Stackelberg network pricing games (Q2429327) (← links)
• Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
• Pricing loss leaders can be hard (Q2637290) (← links)
• Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
• Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
• Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets (Q2959831) (← links)
• On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
• (Q5005149) (← links)
• (Q5075798) (← 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)
• Envy-free pricing in multi-item markets (Q5501961) (← links)
• (Q5743433) (← links)