ORCID as entered in ROS

Select Publications
2017, Proportionally Representative Participatory Budgeting: Axioms and Algorithms, http://dx.doi.org/10.48550/arxiv.1711.08226
,2017, Random Matching under Priorities: Stability and No Envy Concepts, http://arxiv.org/abs/1707.01231v1
,2017, Fractional Hedonic Games, http://dx.doi.org/10.48550/arxiv.1705.10116
,2017, Fair Allocation based on Diminishing Differences, http://dx.doi.org/10.48550/arxiv.1705.07993
,2017, Rank Maximal Equal Contribution: a Probabilistic Social Choice Function, http://dx.doi.org/10.48550/arxiv.1705.00544
,2017, A Polynomial-time Algorithm to Achieve Extended Justified Representation, http://arxiv.org/abs/1703.10415v1
,2017, The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality, http://dx.doi.org/10.48550/arxiv.1701.08023
,2016, Pareto Optimal Allocation under Uncertain Preferences, http://dx.doi.org/10.48550/arxiv.1609.02795
,2016, Stable Matching with Uncertain Linear Preferences, http://dx.doi.org/10.48550/arxiv.1607.02917
,2016, Interdependent Scheduling Games
,2016, Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences, http://dx.doi.org/10.48550/arxiv.1604.07540
,2016, Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment, http://dx.doi.org/10.48550/arxiv.1604.03632
,2016, Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods, http://arxiv.org/abs/1604.01435v1
,2016, Efficient Reallocation under Additive and Responsive Preferences, http://dx.doi.org/10.48550/arxiv.1604.01091
,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, Complexity of Manipulating Sequential Allocation, http://dx.doi.org/10.48550/arxiv.1602.06940
,2015, Boolean Hedonic Games, http://dx.doi.org/10.48550/arxiv.1509.07062
,2015, Egalitarianism of Random Assignment Mechanisms, http://dx.doi.org/10.48550/arxiv.1507.06827
,2015, The Adjusted Winner Procedure: Characterizations and Equilibria, http://dx.doi.org/10.48550/arxiv.1503.06665
,2015, Online Fair Division: analysing a Food Bank problem, http://dx.doi.org/10.48550/arxiv.1502.07571
,2015, On the Susceptibility of the Deferred Acceptance Algorithm, http://dx.doi.org/10.48550/arxiv.1502.06318
,2015, Equilibria Under the Probabilistic Serial Rule, http://dx.doi.org/10.48550/arxiv.1502.04888
,2015, Manipulating the Probabilistic Serial Rule, http://dx.doi.org/10.48550/arxiv.1501.06626
,2015, Algorithms for two variants of Satisfaction Approval Voting
,2014, A Study of Proxies for Shapley Allocations of Transport Costs, http://dx.doi.org/10.48550/arxiv.1408.4901
,2014, Justified Representation in Approval-Based Committee Voting, http://dx.doi.org/10.48550/arxiv.1407.8269
,2014, Computational Aspects of Multi-Winner Approval Voting, http://dx.doi.org/10.48550/arxiv.1407.3247
,2014, Testing Top Monotonicity, http://arxiv.org/abs/1403.7625v5
,2014, Random assignment with multi-unit demands, http://arxiv.org/abs/1401.7700v3
,2014, Strategic aspects of the probabilistic serial rule for the allocation of goods, http://dx.doi.org/10.48550/arxiv.1401.6523
,2014, False-Name Manipulations in Weighted Voting Games, http://dx.doi.org/10.48550/arxiv.1401.3869
,2013, Fair assignment of indivisible objects under ordinal preferences, http://dx.doi.org/10.48550/arxiv.1312.6546
,2013, The Computational Complexity of Random Serial Dictatorship, http://dx.doi.org/10.48550/arxiv.1304.3169
,2012, Testing Substitutability of Weak Preferences, http://dx.doi.org/10.48550/arxiv.1201.0432
,2011, Individual-based stability in hedonic games depending on the best or worst players, http://arxiv.org/abs/1105.1824v2
,2011, Path coalitional games, http://arxiv.org/abs/1103.3310v2
,2010, Stable partitions in additively separable hedonic games, http://dx.doi.org/10.48550/arxiv.1008.0074
,2010, Optimal Partitions in Additively Separable Hedonic Games, http://dx.doi.org/10.48550/arxiv.1005.4540
,2009, Wiretapping a hidden network, http://dx.doi.org/10.48550/arxiv.0909.5293
,2009, Spanning connectivity games, http://arxiv.org/abs/0906.3643v1
,2008, Computing voting power in easy weighted voting games, http://arxiv.org/abs/0811.2497v2
,2008, Complexity of comparison of influence of players in simple games, http://arxiv.org/abs/0809.0519v1
,