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 12 of 12 for “"Winner determination problem"”.

  1. Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions

    … this is equivalent to solving the optimization problem commonly referred to as the Winner Determination Problem. In order to take into account the complexities inherent to the procurement problem, such as considering a supplier’s network, economies of scope, and the inclusion of business rules …

    etsu Repository record for Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions (opens in a new tab) Download PDF for Developing Optimization Techniques for Logistical Tendering Using Reverse Combinatorial Auctions (opens in a new tab)

  2. Expressiveness, Efficiency, and Privacy in Advertising Auctions

    … expressiveness of bids in order to achieve fast winner determination, which is the problem of allocating slots to advertisers so as to maximize the expected revenue given that advertisers are charged what they bid. The goal of this work is to permit more expressive bidding, thus allowing …

    cornell Repository record for Expressiveness, Efficiency, and Privacy in Advertising Auctions (opens in a new tab)

  3. Models and Algorithms for Procurement Combinatorial Auctions

    A key problem in designing marketplaces is how to efficiently allocate a collection of goods among multiple people. Auctions have emerged as a powerful tool with the promise to increase market efficiency by allocating goods to those who value them the most. Nevertheless, traditional auctions are …

    mcmaster Repository record for Models and Algorithms for Procurement Combinatorial Auctions (opens in a new tab)

  4. Game Theory Approaches for Transportation Problems

    … considers three separate game theory problems in transportation. In the first problem, a combinatorial auction market has been proposed for fractional ownership of autonomous vehicles. The proposed combinatorial auction has two unique features. First, the items are continuous time …

    usf Repository record for Game Theory Approaches for Transportation Problems (opens in a new tab)

  5. EXPRESSING PREFERENCES WITH PRICE-VECTOR AGENTS IN COMBINATORIAL AUCTIONS

    … variety of bidding information. We show that the winner determination problem for this Matrix Bid Auction is NP-hard, provide results from a series of computational experiments, and develop IP techniques for improving run time. In addition to the results on price-vector agents, bid tables, and …

    maryland Repository record for EXPRESSING PREFERENCES WITH PRICE-VECTOR AGENTS IN COMBINATORIAL AUCTIONS (opens in a new tab)

  6. Multi-carrier track capacity allocation in forward and spot markets of freight transport

    … multi-carrier, multi-line train scheduling problems for forward and spot markets. Schedules resulting from solution of these train scheduling problems enable carriers to make customer commitments for serving forward contracts and to transport one-off-loads arising on spot markets. A train …

    maryland Repository record for Multi-carrier track capacity allocation in forward and spot markets of freight transport (opens in a new tab)

  7. Dynamic Resource Allocation and Pricing: A Randomized Auction Perspective

    … computationally infeasible when the underlying winner determination problem is NP-hard. Simply substituting the optimal solutions with approximate solutions makes a VCG auction lose its truthfulness property. In this thesis, we aim to address this challenge by employing a randomized auction …

    calgary Repository record for Dynamic Resource Allocation and Pricing: A Randomized Auction Perspective (opens in a new tab)

  8. Solving large scale office scheduling problems as combinatorial auctioning problems

    … the utilisation of available office spaces. The problem of allocating employees to offices is known within the realm of operations research as the office space allocation problem (OSA). Using an auctioning approach, this study proposes to construct office schedules by determining the winners in …

    nwu-za Repository record for Solving large scale office scheduling problems as combinatorial auctioning problems (opens in a new tab)

  9. Algorithmic and game-theoretic aspects of computational social choice

    … on the outcome of others. We first focus on the winner determination problem under the natural voting rule that minimizes voters’ total dissatisfaction, referred to as Conditional Minisum. We present positive and negative results for approximate and parameterized algorithms. Additionally, we …

    greece Repository record for Algorithmic and game-theoretic aspects of computational social choice (opens in a new tab)

  10. Representations and Parameterizations of Combinatorial Auctions

    … the allocation of items is known as the winner determination problem (WDP). WDP for CAs is known to be NP-complete in the general case. We consider two distinct graph representations of a CA; the bid graph and the item graph. In a bid graph, vertices represent bids, and two vertices are …

    waterloo Repository record for Representations and Parameterizations of Combinatorial Auctions (opens in a new tab)

  11. Combinatorial auctions : theory, experiments, and practice

    … 2, we theoretically investigate the classical winner determination problem in geometrical settings. Specifically, we consider combinatorial auctions of items that can be arranged in rows, and the objective is, given bids on subsets of items, to find a subset of bids that maximizes auction …

    ghent Repository record for Combinatorial auctions : theory, experiments, and practice (opens in a new tab)