extended-abstract

Public Access

Indivisible Mixed Manna: On the Computability of MMS+PO Allocations

Authors:

Rucha Kulkarni,

Ruta Mehta,

Setareh TakiAuthors Info & Claims

EC '21: Proceedings of the 22nd ACM Conference on Economics and Computation

Pages 683 - 684

https://doi.org/10.1145/3465456.3467553

Published: 18 July 2021 Publication History

PDF eReader

Abstract

No abstract available.

References

[1]

Sylvain Bouveret and Michel Lemaitre. 2016. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems 30, 2 (2016), 259--290.

Digital Library

Google Scholar

[2]

Jugal Garg and Setareh Taki. 2020. An Improved Approximation Algorithm for Maximin Shares. In Proceedings of the21st ACM Conference on Economics and Computation (EC '20). 379--380. https://doi.org/10.1145/3391403.3399526

Digital Library

Google Scholar

[3]

Mohammad Ghodsi, Mohammadtaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, and Hadi Yami. 2018. Fair Allocation of Indivisible Goods: Improvements and Generalizations. In Proceedings of the 2018 ACM Conference on Economics and Computation (EC '18). https://doi.org/10.1145/3219166.3219238

Digital Library

Google Scholar

[4]

Laurent Gourves and Jerome Monnot. 2019. On maximin share allocations in matroids. Theor. Comput. Sci.754 (2019),50--64.

Crossref

Google Scholar

[5]

Xin Huang and Pinyan Lu. 2019. An algorithmic framework for approximating maximin share allocation of chores. CoRRabs/1907.04505 (2019). arXiv:1907.04505 http://arxiv.org/abs/1907.04505

Google Scholar

[6]

David Kurokawa, Ariel D. Procaccia, and Junxing Wang. 2018. Fair Enough: Guaranteeing Approximate Maximin Shares. J. ACM65, 2 (2018), 8:1--8:27.

Digital Library

Google Scholar

Cited By

View all

Aziz HLi BMoulin HWu X(2022)Algorithmic fair allocation of indivisible itemsACM SIGecom Exchanges10.1145/3572885.357288720:1(24-40)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.1145/3572885.3572887
Aziz HLi BWu X(2022)Approximate and strategyproof maximin share allocation of chores with ordinal preferencesMathematical Programming: Series A and B10.1007/s10107-022-01855-y203:1-2(319-345)Online publication date: 5-Jul-2022
https://dl.acm.org/doi/10.1007/s10107-022-01855-y
Mishra SPadala MGujar S(2022)Fair Allocation with Special ExternalitiesPRICAI 2022: Trends in Artificial Intelligence10.1007/978-3-031-20862-1_1(3-16)Online publication date: 10-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-20862-1_1

Index Terms

Indivisible Mixed Manna: On the Computability of MMS+PO Allocations
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Multi-agent systems
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Theory and algorithms for application domains
    1. Algorithmic game theory and mechanism design
      1. Algorithmic game theory

Recommendations

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations
AAMAS '21: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems

We study fair and economically efficient allocation of indivisible goods among agents whose valuations are rank functions of matroids. Such valuations constitute a well-studied class of submodular functions (i.e., they exhibit a diminishing returns ...
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna
AAMAS '22: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems

We study the problem of finding fair and efficient allocations of a set of indivisible items to a set of agents, where each item may be a good (positively valued) for some agents and a bad (negatively valued) for others, i.e., a mixed manna. As fairness ...
Computing Competitive Equilibria with Mixed Manna
AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems

Fair division is the problem of allocating a set of items among a set of agents in a fair and efficient way. It arises naturally in a wide range of real-life settings. Competitive equilibrium (CE) is a central solution concept in economics to study ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

EC '21: Proceedings of the 22nd ACM Conference on Economics and Computation

July 2021

950 pages

ISBN:9781450385541

DOI:10.1145/3465456

General Chair:
Péter Biró
Hungarian Academy of Sciences
,
Program Chairs:
Shuchi Chawla
University of Wisconsin-Madison and University of Texas at Austin
,
Federico Echenique
California Institute of Technology

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2021

Check for updates

Author Tags

Qualifiers

Extended-abstract

Funding Sources

NSF (National Science Foundation)

Conference

EC '21

Sponsor:

SIGecom

EC '21: The 22nd ACM Conference on Economics and Computation

July 18 - 23, 2021

Budapest, Hungary

Acceptance Rates

Overall Acceptance Rate 664 of 2,389 submissions, 28%

Upcoming Conference

EC '25

Sponsor:
sigecom

The 25th ACM Conference on Economics and Computation

July 7 - 11, 2025

Stanford , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
228
Total Downloads

Downloads (Last 12 months)84
Downloads (Last 6 weeks)12

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Aziz HLi BMoulin HWu X(2022)Algorithmic fair allocation of indivisible itemsACM SIGecom Exchanges10.1145/3572885.357288720:1(24-40)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.1145/3572885.3572887
Aziz HLi BWu X(2022)Approximate and strategyproof maximin share allocation of chores with ordinal preferencesMathematical Programming: Series A and B10.1007/s10107-022-01855-y203:1-2(319-345)Online publication date: 5-Jul-2022
https://dl.acm.org/doi/10.1007/s10107-022-01855-y
Mishra SPadala MGujar S(2022)Fair Allocation with Special ExternalitiesPRICAI 2022: Trends in Artificial Intelligence10.1007/978-3-031-20862-1_1(3-16)Online publication date: 10-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-20862-1_1

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations

(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna

Computing Competitive Equilibria with Mixed Manna