Skip To Main Content
Mashbat Suzuki on Muck Rack

Mashbat Suzuki

As seen in: arXiv
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Mashbat

Contact Mashbat, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Computer Science and Game Theory

|
By Simon Mackenzie, Mashbat Suzuki
| arXiv
We study the fair allocation of $m$ indivisible items to $n$ agents with additive utilities. In our setting, each indivisible item may be a good, yielding non-negative utility to some agents, or a chore, yielding negative utility to others.
Open in Who Shared Issue with article?

[2511.04891] Fair Division with Indivisible Goods, Chores, and Cake

|
By Xinhang Lu, Simon Mackenzie, Mashbat Suzuki
| arXiv
arXiv:2511.04891 (cs) View PDF HTML (experimental) Subjects: Computer Science and Game Theory (cs.GT) Cite as: arXiv:2511.04891 [cs.GT] (or arXiv:2511.04891v1 [cs.GT] for this version) https://doi.org/10.48550/arXiv.2511.04891 Submission history From: Xinhang Lu [ view email] [v1] Fri, 7 Nov 2025 00:32:29 UTC (31 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is...
Open in Who Shared View Duplicates (77) Issue with article?

[2502.17869] Maximum Welfare Allocations under Quantile Valuations

|
By Shivika Narang, Mashbat Suzuki
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (431) Issue with article?
See all 12 articles