ORCID as entered in ROS

Select Publications
2023, 'Computing welfare-Maximizing fair allocations of indivisible goods', European Journal of Operational Research, 307, pp. 773 - 784, http://dx.doi.org/10.1016/j.ejor.2022.10.013
,2023, 'Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation', Operations Research, http://dx.doi.org/10.1287/opre.2022.2432
,2023, 'Portioning using ordinal preferences: Fairness and efficiency', Artificial Intelligence, 314, pp. 103809 - 103809, http://dx.doi.org/10.1016/j.artint.2022.103809
,2022, 'The vigilant eating rule: A general approach for probabilistic economic design with constraints', Games and Economic Behavior, 135, pp. 168 - 187, http://dx.doi.org/10.1016/j.geb.2022.06.002
,2022, 'Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions', ACM SIGECOM EXCHANGES, 20, pp. 24 - 40, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000891505400003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
,2022, 'A characterization of proportionally representative committees', Games and Economic Behavior, 133, pp. 248 - 255, http://dx.doi.org/10.1016/j.geb.2022.03.006
,2022, 'Fair allocation of indivisible goods and chores', Autonomous Agents and Multi-Agent Systems, 36, http://dx.doi.org/10.1007/s10458-021-09532-8
,2022, 'Stable matching with uncertain pairwise preferences', Theoretical Computer Science, 909, pp. 1 - 11, http://dx.doi.org/10.1016/j.tcs.2022.01.028
,2022, 'Approximate and strategyproof maximin share allocation of chores with ordinal preferences', Mathematical Programming, http://dx.doi.org/10.1007/s10107-022-01855-y
,2022, 'Cutoff stability under distributional constraints with an application to summer internship matching', Mathematical Programming, http://dx.doi.org/10.1007/s10107-022-01917-1
,2022, 'Algorithmic fair allocation of indivisible items', ACM SIGecom Exchanges, 20, pp. 24 - 40, http://dx.doi.org/10.1145/3572885.3572887
,2021, 'Two-sided Matching with Diversity Concerns: An Annotated Reading List', ACM SIGECOM EXCHANGES, 19, pp. 15 - 17, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000674752000005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
,2021, 'Participatory Budgeting: Models and Approaches', , pp. 215 - 236, http://dx.doi.org/10.1007/978-3-030-54936-7_10
,2021, 'Two-sided matching with diversity concerns', ACM SIGecom Exchanges, 19, pp. 15 - 17, http://dx.doi.org/10.1145/3476436.3476440
,2020, 'Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences', , http://arxiv.org/abs/2012.13884v1
,2020, 'A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation', Operations Research Letters, 48, pp. 573 - 578, http://dx.doi.org/10.1016/j.orl.2020.07.005
,2020, 'Stable Matching with Uncertain Linear Preferences', Algorithmica, 82, pp. 1410 - 1433, http://dx.doi.org/10.1007/s00453-019-00650-0
,2020, 'Strategyproof multi-item exchange under single-minded dichotomous preferences', Autonomous Agents and Multi-Agent Systems, 34, http://dx.doi.org/10.1007/s10458-019-09426-w
,2020, 'A Bounded and Envy-Free Cake Cutting Algorithm', Communications of the ACM, 63, pp. 119 - 126, http://dx.doi.org/10.1145/3382129
,2020, 'Fair allocation with diminishing differences', Journal of Artificial Intelligence Research, 67, pp. 471 - 507, http://dx.doi.org/10.1613/JAIR.1.11994
,2020, 'A characterization of proportionally representative committees', , http://arxiv.org/abs/2002.09598v2
,2020, 'Stable Matching with Uncertain Linear Preferences.', Algorithmica, 82, pp. 1410 - 1433, http://dx.doi.org/10.1007/s00453-019-00650-0
,2019, 'A Rule for Committee Selection with Soft Diversity Constraints', Group Decision and Negotiation, 28, pp. 1193 - 1200, http://dx.doi.org/10.1007/s10726-019-09634-5
,2019, 'Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity', Artificial Intelligence, 276, pp. 57 - 78, http://dx.doi.org/10.1016/j.artint.2019.08.002
,2019, 'Efficient reallocation under additive and responsive preferences', Theoretical Computer Science, 790, pp. 1 - 15, http://dx.doi.org/10.1016/j.tcs.2019.05.011
,2019, 'Justifications of Welfare Guarantees under Normalized Utilities', SI GECOM EXCHANGES, 17, pp. 71 - 75, http://dx.doi.org/10.1145/3381329.3381337
,2019, 'Strategyproof peer selection using randomization, partitioning, and apportionment', Artificial Intelligence, 275, pp. 295 - 309, http://dx.doi.org/10.1016/j.artint.2019.06.004
,2019, 'Algorithms for Pareto optimal exchange with bounded exchange cycles', Operations Research Letters, 47, pp. 344 - 347, http://dx.doi.org/10.1016/j.orl.2019.06.002
,2019, 'Random matching under priorities: stability and no envy concepts', Social Choice and Welfare, 53, pp. 213 - 259, http://dx.doi.org/10.1007/s00355-019-01181-x
,2019, 'Fractional hedonic games', ACM Transactions on Economics and Computation, 7, http://dx.doi.org/10.1145/3327970
,2018, 'An impossibility result for housing markets with fractional endowments', Operations Research Letters, 46, pp. 473 - 475, http://dx.doi.org/10.1016/j.orl.2018.07.001
,2018, 'Fixing balanced knockout and double elimination tournaments', Artificial Intelligence, 262, pp. 1 - 14, http://dx.doi.org/10.1016/j.artint.2018.05.002
,2018, 'Fair allocation of combinations of indivisible goods and chores', , http://arxiv.org/abs/1807.10684v4
,2018, 'On the tradeoff between efficiency and strategyproofness', Games and Economic Behavior, 110, pp. 1 - 18, http://dx.doi.org/10.1016/j.geb.2018.03.005
,2018, 'Proportional Representation in Approval-based Committee Voting and Beyond', , http://arxiv.org/abs/1802.00882v1
,2017, 'Computational aspects of assigning agents to a line', Mathematical Social Sciences, 90, pp. 93 - 99, http://dx.doi.org/10.1016/j.mathsocsci.2017.02.004
,2017, 'Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences', Economics Letters, 160, pp. 46 - 49, http://dx.doi.org/10.1016/j.econlet.2017.08.010
,2017, 'Impossibilities for probabilistic assignment', Social Choice and Welfare, 49, pp. 255 - 275, http://dx.doi.org/10.1007/s00355-017-1059-3
,2017, 'A Polynomial-time Algorithm to Achieve Extended Justified Representation', , http://arxiv.org/abs/1703.10415v1
,2017, 'Computational aspects of assigning agents to a line', Mathematical Social Sciences, 86, pp. 68 - 74, http://dx.doi.org/10.1016/j.mathsocsci.2016.12.004
,2017, 'Complexity of Manipulating Sequential Allocation', Proceedings of the AAAI Conference on Artificial Intelligence, 31, http://dx.doi.org/10.1609/aaai.v31i1.10586
,2017, 'Justified representation in approval-based committee voting', Social Choice and Welfare, 48, pp. 461 - 485, http://dx.doi.org/10.1007/s00355-016-1019-3
,2017, 'Bounded and Envy-free Cake Cutting', ACM SIGECOM EXCHANGES, 15, pp. 30 - 33, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000395897600004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
,2017, 'Characterizing SW-efficiency in the social choice domain', Economics Bulletin, 37, pp. 48 - 51
,2016, 'A study of proxies for shapley allocations of transport costs', Journal of Artificial Intelligence Research, 56, pp. 573 - 611, http://dx.doi.org/10.1613/jair.5021
,2016, 'Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods', , http://arxiv.org/abs/1604.01435v1
,2016, 'A Comment on the Averseness of Random Serial Dictatorship to Stochastic Dominance Efficiency', , http://arxiv.org/abs/1603.07392v2
,2016, 'Mechanisms for House Allocation with Existing Tenants under Dichotomous Preferences', , http://arxiv.org/abs/1603.03073v2
,2016, 'Review of', ACM SIGACT News, 47, pp. 6 - 8, http://dx.doi.org/10.1145/2902945.2902948
,2016, 'AI's 10 to Watch', IEEE INTELLIGENT SYSTEMS, 31, pp. 56 - 56, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000369391800008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
,