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 9 of 9 for “"online allocation"”.

  1. Online Allocation with Concave and Convex Objectives

    Online allocation refers to the problem of allocating a unknown sequence of arriving items to agents in order to maximize or minimize some objective. Such problems fall into the broad field of optimization under uncertainty, as each item must be allocated immediately without knowledge of future …

    gatech Repository record for Online Allocation with Concave and Convex Objectives (opens in a new tab)

  2. Fairness and Efficiency in Online Allocation of Goods

    … I concentrate on the case of repeated allocation of goods, a common problem in practice, as many resources are allocated to recipients on monthly or daily basis. Throughout this work, we show how repeated nature of allocation can be leveraged to achieve strong efficiency, fairness and …

    cornell Repository record for Fairness and Efficiency in Online Allocation of Goods (opens in a new tab)

  3. Efficient algorithms for online resource allocation and submodular maximization

    … for fundamental optimization problems in online allocation and submodular maximization. We focus on algorithms that obtain strong theoretical guarantees without sacrificing practicality. We design algorithms with improved approximation guarantees and fast end-to-end running time. Our …

    bu Repository record for Efficient algorithms for online resource allocation and submodular maximization (opens in a new tab)

  4. 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)

  5. Online Fair Division with Indivisible Items

    … the agents for the resources. By comparison, in Online Fair Division, the resources arrive over time and are allocated to agents only as they become available supposing limited information about resources that could possibly arrive in the future. In this thesis, I study the problem of online fair …

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

  6. Algorithmic aspects of connectivity, allocation and design problems

    … Steiner tree problem on quasi-bipartite graphs. Allocation Problems: We study the budgeted al location problem of allocating a set of indivisible items to a set of agents who bid on it but possess a hard budget constraint more than which they are unwilling to pay. This problem is a special case …

    gatech Repository record for Algorithmic aspects of connectivity, allocation and design problems (opens in a new tab)

  7. Incentives, Causality, and Fairness: The Mathematics of Societal Decision-Making

    … First, I'll look at a problem of resource allocation under multi-faceted priorities. Next, I'll consider the problem of forming optimal work groups under a variety of models of team synergy. Finally, I'll consider the problem of estimating the effect of a treatment on a population in the …

    cornell Repository record for Incentives, Causality, and Fairness: The Mathematics of Societal Decision-Making (opens in a new tab)

  8. Serving online requests with mobile resources

    Resource allocation problems have a large variety of applications in different areas of computer science and operations research. A resource allocation problem seeks to find an optimal allocation of a given type of expensive or limited resource to a set of clients that request the services of the …

    freiburg-diss Repository record for Serving online requests with mobile resources (opens in a new tab)

  9. Αλγόριθμοι δρομολόγησης και δέσμευσης φάσματος σε ελαστικά οπτικά δίκτυα

    … VNE mechanism for parameterizing the way the online VNE algorithm will operate. To do so, it blocks virtual network requests that if served would negatively affect the performance of the network in the future (waste of network resources, increasing the fragmentation of the network, etc). For …

    greece Repository record for Αλγόριθμοι δρομολόγησης και δέσμευσης φάσματος σε ελαστικά οπτικά δίκτυα (opens in a new tab)