Pages that link to "Item:Q4648689"
From MaRDI portal
The following pages link to On stackelberg pricing with computationally bounded customers (Q4648689):
Displaying 10 items.
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (Q2020618) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- On the Complexity of Stackelberg Matroid Pricing Problems (Q5041182) (← links)
- Stackelberg packing games (Q5925607) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
