The following pages link to (Q2921790):
Displaying 25 items.
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
- Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets (Q2959826) (← links)
- Anonymous Auctions Maximizing Revenue (Q2959830) (← links)
- Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets (Q2959831) (← links)
- A polyhedral study of the network pricing problem with connected toll arcs (Q3057150) (← links)
- Stackelberg network pricing is hard to approximate (Q3082599) (← links)
- The Envy-Free Pricing Problem and Unit-Demand Markets (Q3195332) (← links)
- Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare (Q3448773) (← links)
- Combinatorial Walrasian Equilibrium (Q3460334) (← links)
- Ad Exchange: Envy-Free Auctions with Mediators (Q3460780) (← links)
- On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
- Competitive Equilibrium with Indivisible Goods and Generic Budgets (Q4991681) (← links)
- (Q5005149) (← links)
- (Q5075798) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- (Q5111298) (← links)
- Tight Revenue Gaps Among Simple Mechanisms (Q5123985) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- Pricing bridges to cross a river (Q5436961) (← links)
- Envy-free pricing in multi-item markets (Q5501961) (← links)
- (Q5743433) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Walrasian pricing in multi-unit auctions (Q6136100) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)