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 2 of 2 for “"Budgeted auctions"”.

  1. Algorithms for budgeted auctions and multi-agent covering problems

    … an algorithmic study of optimization problems in budgeted auctions, and some well known covering problems in the multi-agent setting. We give new results for the design of approximation algorithms, online algorithms and hardness of approximation for these problems. Along the way we give new …

    gatech Repository record for Algorithms for budgeted auctions and multi-agent covering problems (opens in a new tab)

  2. Algorithmic aspects of connectivity, allocation and design problems

    … 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 of submodular welfare maximization. …

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