The following pages link to (Q2921790):
Displaying 50 items.
- On revenue maximization with sharp multi-unit demands (Q266046) (← links)
- Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
- Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
- Pricing commodities (Q627117) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- On the complexity of a bundle pricing problem (Q657580) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- Price strategy implementation (Q709178) (← links)
- Online pricing for bundles of multiple items (Q742127) (← links)
- A hybrid approach to the solution of a pricing model with continuous demand segmentation (Q743631) (← links)
- On core-selecting and core-competitive mechanisms for binary single-parameter auctions (Q777973) (← links)
- Graph pricing with limited supply (Q832882) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- New formulations and valid inequalities for a bilevel pricing problem (Q935200) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- Location, pricing and the problem of Apollonius (Q1686568) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- Recent studies of agent incentives in internet resource allocation and pricing (Q1728405) (← 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)
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (Q2020618) (← 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)
- Recent studies of agent incentives in Internet resource allocation and pricing (Q2159522) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Pricing lotteries (Q2253836) (← links)
- Online pricing for multi-type of items (Q2257292) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- On social envy-freeness in multi-unit markets (Q2321269) (← links)
- Auctions with online supply (Q2343399) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- The power of randomness in Bayesian optimal mechanism design (Q2347783) (← links)
- Efficiency and complexity of price competition among single-product vendors (Q2407455) (← links)
- On envy-free perfect matching (Q2414450) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- The power of fair pricing mechanisms (Q2429364) (← links)
- Optimal deterministic auctions with correlated priors (Q2516251) (← links)
- Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Approximate competitive equilibrium with generic budget (Q2670929) (← links)
- Automated Design of Revenue-Maximizing Combinatorial Auctions (Q2795862) (← links)
