[HTML][HTML] Fintech innovation in social service provision: a bibliometric review

A Munodei, AB Sibindi - Social Sciences, 2023 - mdpi.com
The employment of fintech as a product and service distribution mechanism in various
sectors has been widely adopted for the provision of seamless services. The adoption of …

Computing fair and efficient allocations with few utility values

J Garg, A Murhekar - Theoretical Computer Science, 2023 - Elsevier
We study the problem of allocating indivisible goods among agents with additive valuations
in a fair and efficient manner, when agents have few utility values for the goods. We consider …

Approximating Nash social welfare under Rado valuations

J Garg, E Husić, LA Végh - Proceedings of the 53rd Annual ACM …, 2021 - dl.acm.org
We consider the problem of approximating maximum Nash social welfare (NSW) while
allocating a set of indivisible items to n agents. The NSW is a popular objective that provides …

Fair division with allocator's preference

X Bu, Z Li, S Liu, J Song, B Tao - International Conference on Web and …, 2023 - Springer
We consider the problem of fairly allocating indivisible resources to agents, which has been
studied for years. Most previous work focuses on fairness and/or efficiency among agents …

Budget-feasible maximum nash social welfare is almost envy-free

X Wu, B Li, J Gan - 2021 - ora.ox.ac.uk
The Nash social welfare (NSW) is a well-known social welfare measurement that balances
individual utilities and the overall efficiency. In the context of fair allocation of indivisible …

[PDF][PDF] Indivisible mixed manna: On the computability of MMS+ PO allocations

R Kulkarni, R Mehta, S Taki - Proceedings of the 22nd ACM Conference …, 2021 - dl.acm.org
In this paper we study the problem of finding fair and efficient allocations of a mixed manna,
ie, a set M of discrete items that are goods/chores, among a set N of agents with additive …

Tractable fragments of the maximum nash welfare problem

J Garg, E Husić, A Murhekar, L Végh - arXiv preprint arXiv:2112.10199, 2021 - arxiv.org
We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods
to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of …

Ordinal maximin share approximation for chores

H Hosseini, A Searns, E Segal-Halevi - arXiv preprint arXiv:2201.07424, 2022 - arxiv.org
We study the problem of fairly allocating a set of m indivisible chores (items with non-positive
value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin share …

On fair and efficient allocations of indivisible public goods

J Garg, P Kulkarni, A Murhekar - arXiv preprint arXiv:2107.09871, 2021 - arxiv.org
We study fair allocation of indivisible public goods subject to cardinality (budget) constraints.
In this model, we have n agents and m available public goods, and we want to select $ k\leq …

Fair division of indivisible goods for a class of concave valuations

BR Chaudhury, YK Cheung, J Garg, N Garg… - Journal of Artificial …, 2022 - jair.org
We study the fair and efficient allocation of a set of indivisible goods among agents, where
each good has several copies, and each agent has an additively separable concave …