Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 59 for “"Fair Division"”.

  1. Fair division of indivisible items

    We study the fair division of indivisible items. In the general model, the goal is to find a way to allocate m indivisible items to n agents, while satisfying some fairness criteria. We are particularly interested in the fairness criteria of maximin share (MMS), envy-freeness up to one item (EF1), …

    uvic Repository record for Fair division of indivisible items (opens in a new tab)

  2. Fair division of the commons

    … which the agents can make these decisions in a fair manner. By fairness, we will mean that for every group member, a proportional part of the common budget is spent in accordance with the member's interests. We will also be interested to take into account the interests of subgroups, and when …

    oxford Repository record for Fair division of the commons (opens in a new tab)

  3. A brief introduction into fair division

    This report discusses the theory of fair division from its history to its uses in social sciences. Fair division goes beyond the envy free solution of the cake cutting problem to how people divide chores and rent and allocate assets in a divorce. Fair division can also potentially be used to solve …

    texas Repository record for A brief introduction into fair division (opens in a new tab)

  4. Improvements in Discrete Fair Division Topics

    Η δίκαιη κατανομή αδιαίρετων αγαθών είναι ένα κεντρικό πρόβλημα των Μαθηματικών και της Θεωρητικής Πληροφορικής όπου στόχος είναι να διανεμηθούν πόροι μεταξύ οντοτήτων με τέτοιο τρόπο ώστε να πληρούνται αυστηρά τεκμηριωμένες έννοιες δικαιοσύνης. Η παρούσα εργασία μελετά προσεγγιστικές λύσεις ως …

    athens Repository record for Improvements in Discrete Fair Division Topics (opens in a new tab)

  5. Online Fair Division with Indivisible Items

    (Offline) Fair Division is a fundamental problem in which a number of resources are allocated to a number of agents supposing complete information about the preferences of the agents for the resources. By comparison, in Online Fair Division, the resources arrive over time and are allocated to …

    unsw Repository record for Online Fair Division with Indivisible Items (opens in a new tab)

  6. Essays on Fair Division and Social Choice

    In my dissertation, I studied Social Choice and Fair Division problems under uncertainty. In the first chapter, I defined welfare egalitarianism in the form of certainty equivalence where the individuals are endowed with state contingent consumption bundles and provided an axiomatic …

    rice Repository record for Essays on Fair Division and Social Choice (opens in a new tab)

  7. Essays on Fair Division and Monopoly Pricing

    … chapter is based on a paper with Jingyi Xue in fair division problems. In this chapter, we consider the problem of fairly dividing a finite number of divisible goods among agents with the generalized Leontief preferences. We propose and characterize the class of generalized egalitarian rules …

    rice Repository record for Essays on Fair Division and Monopoly Pricing (opens in a new tab)

  8. Algorithms for fair division through competitive equilibrium

    I study the age old problem of fair and efficient resource allocation. While many fairness notions exist, competitive equilibrium (CE) is often the most preferred as it satisfies multiple other fairness properties simultaneously. The approach creates a fictitious market for the items by endowing …

    uiuc Repository record for Algorithms for fair division through competitive equilibrium (opens in a new tab)

  9. Fair division of indivisibles through the computational lens

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms

    uiuc Repository record for Fair division of indivisibles through the computational lens (opens in a new tab)

  10. FAIR DIVISION OF RESOURCES: FROM INDIVISIBLE GOODS TO CAKES

    In fair division, the goal is to divide a set of resources amongst several agents so that every agent receives what they perceive to be a fair share. This is often a challenging task. This thesis aims to provide more insights into fair division by studying structures, algorithms, and complexities …

    nus Repository record for FAIR DIVISION OF RESOURCES: FROM INDIVISIBLE GOODS TO CAKES (opens in a new tab) Download file for FAIR DIVISION OF RESOURCES: FROM INDIVISIBLE GOODS TO CAKES (opens in a new tab)

  11. Möglichkeiten und Grenzen von fair division im schweizerischen Erbrecht

    zurich Restricted access

  12. Geometric partitioning algorithms for fair division of geographic resources

    This dissertation focuses on a fundamental but under-researched problem: how does one divide a piece of territory into smaller pieces in an efficient way? In particular, we are interested in \emph{map segmentation problem} of partitioning a geographic region into smaller subregions for allocating …

    umn Repository record for Geometric partitioning algorithms for fair division of geographic resources (opens in a new tab)

  13. Fair division: addressing complement-free valuations and online settings

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms

    uiuc Repository record for Fair division: addressing complement-free valuations and online settings (opens in a new tab)

  14. Three essays on fair division and decision making under uncertainty

    … first chapter is based on a paper with Jin Li in fair division. It was recently discovered that on the domain of Leontief preferences, Hurwicz (1972)'s classic impossibility result does not hold; that is, one can find efficient, strategy-proof and individually rational rules to divide resources …

    rice Repository record for Three essays on fair division and decision making under uncertainty (opens in a new tab)

  15. Fair division of indivisibles: on the computability of maximin share (MMS) allocations

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms

    uiuc Repository record for Fair division of indivisibles: on the computability of maximin share (MMS) allocations (opens in a new tab)

  16. Algorithms and complexity results for problems on fair division and imitation games

    … of allocating indivisible goods to agents in a fair and efficient manner. We consider different notions of fairness such as envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) in conjuction with Pareto-optimality (PO). We present polynomial time algorithms for computing …

    uiuc Repository record for Algorithms and complexity results for problems on fair division and imitation games (opens in a new tab)

  17. Mechanisms for a Pluralistic World: From Voting and Fair Division to AI Alignment

    … decision-making mechanisms that are both fair to individuals and efficient in their use of resources. It undertakes a systematic exploration of socially-aligned mechanisms across voting, resource allocation, and emerging applications in sortition and AI alignment. A central theme is the …

    toronto-retro Repository record for Mechanisms for a Pluralistic World: From Voting and Fair Division to AI Alignment (opens in a new tab)

  18. Essays in Cooperative Stability

    … exchange economies with private endowments and fair division problems. Solutions that are stable in our sense are core selections. We also show that it is weaker than population monotonicity in cooperative games and fair division problems, and very demanding for the allocation problems with …

    rice Repository record for Essays in Cooperative Stability (opens in a new tab)

  19. ALLOCATING INDIVISIBLE GOODS: FAIRNESS AND EFFICIENCY

    … resources is a perennial societal challenge. As fairness is often a central consideration in such decisions, the problem of fair division has been extensively studied by mathematicians, economists, and computer scientists alike. In particular, fair division of indivisible goods is a subtopic that …

    nus Repository record for ALLOCATING INDIVISIBLE GOODS: FAIRNESS AND EFFICIENCY (opens in a new tab) Download file for ALLOCATING INDIVISIBLE GOODS: FAIRNESS AND EFFICIENCY (opens in a new tab)

Page 1 of 3