scientific article; zbMATH DE number 7378364
From MaRDI portal
Publication:5005149
DOI10.4230/LIPIcs.MFCS.2018.47MaRDI QIDQ5005149
Gianpiero Monaco, Luca Moscardelli, Michele Flammini, Vittorio Bilò
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Inequity aversion pricing over social networks: approximation algorithms and hardness results ⋮ On fair price discrimination in multi-unit markets ⋮ On social envy-freeness in multi-unit markets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On revenue maximization with sharp multi-unit demands
- Approximating the revenue maximization problem with sharp demands
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Exact methods for the knapsack problem and its generalizations
- Walrasian equilibrium with gross substitutes
- Competitive equilibrium in an exchange economy with indivisibilities
- On social envy-freeness in multi-unit markets
- Optimal Envy-Free Pricing with Metric Substitutability
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
- Combinatorial Walrasian Equilibrium
- Uniform Budgets and the Envy-Free Pricing Problem
- Single-minded unlimited supply pricing on sparse instances
- Envy-Free Pricing in Multi-item Markets
- Fast Approximation Algorithms for Knapsack Problems
- Incentives in Teams
- Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
This page was built for publication:
