On social envy-freeness in multi-unit markets
From MaRDI portal
Publication:2321269
DOI10.1016/J.ARTINT.2018.12.003zbMath1482.91097OpenAlexW2903990934WikidataQ128749594 ScholiaQ128749594MaRDI QIDQ2321269
Matteo Tonelli, Manuel Mauro, Michele Flammini
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2018.12.003
Social networks; opinion dynamics (91D30) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Envy-free allocations respecting social networks ⋮ On reachable assignments under dichotomous preferences ⋮ Unnamed Item ⋮ Inequity aversion pricing over social networks: approximation algorithms and hardness results ⋮ On fair price discrimination in multi-unit markets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed fair allocation of indivisible goods
- Approximating the revenue maximization problem with sharp demands
- Graphical congestion games
- The efficiency of fair division
- Multi-unit auctions with budget limits
- When ignorance helps: graphical multicast cost sharing games
- A note on maximizing a submodular set function subject to a knapsack constraint
- On complexity of single-minded auction
- Multi-unit auctions: beyond Roberts
- Truthful approximation mechanisms for restricted combinatorial auctions
- A resource allocation queueing fairness measure: properties and bounds
- Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets
- Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Truth revelation in approximately efficient combinatorial auctions
- Uniform Budgets and the Envy-Free Pricing Problem
- How to Sell a Graph: Guidelines for Graph Retailers
- Relations between average case complexity and approximation complexity
- Knapsack auctions
- Envy-Free Pricing in Multi-item Markets
- Fast Approximation Algorithms for Knapsack Problems
- Incentives in Teams
- An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
- Mechanisms for Multi-Unit Auctions
- Algorithms and Data Structures
- Algorithmic Game Theory
- Automata, Languages and Programming
- Clinching Auctions with Online Supply
This page was built for publication: On social envy-freeness in multi-unit markets
