Browsing Computer Science and Automation (CSA) by Subject "Computational Social Choice"
Now showing items 1-3 of 3
-
Algorithms for Achieving Fairness and Efficiency in Matching Problems
Matching problems arise in numerous practical settings. Fairness and efficiency are two desirable properties in most such real world scenarios. This dissertation work presents new approaches and models for capturing and ... -
Exploring Welfare Maximization and Fairness in Participatory Budgeting
Participatory budgeting (PB) is a voting paradigm for distributing a divisible resource, usually called a budget, among a set of projects by aggregating the preferences of individuals over these projects. It is implemented ... -
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
(2017-12-16)In many real world situations, especially involving multiagent systems and artificial intelligence, participating agents often need to agree upon a common alternative even if they have differing preferences over the available ...