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 20 for “"Winner Determination"”.

  1. Evolutionary Winner Determination in Advanced Combinatorial Reverse Auctions

    … of items; the complexity of CRAs increases. Winner Determination (WD) is one of the main challenges of CRAs, and which has been shown to be NP-complete. Researchers limit the auction features because of the issue of time efficiency. We address several types of advanced CRAs by varying the …

    regina Repository record for Evolutionary Winner Determination in Advanced Combinatorial Reverse Auctions (opens in a new tab) Download PDF for Evolutionary Winner Determination in Advanced Combinatorial Reverse 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. Combinatorial Auctions for Truckload Transportation Procurement

    … dual prices derived from the result of a winner determination solution are used by the bidders in identifying profitable lanes. The auctions also allow the bidders to submit exclusive-OR (XOR) bids and are able to deal with some common business considerations. The extension of the concept …

    toronto-retro Repository record for Combinatorial Auctions for Truckload Transportation Procurement (opens in a new tab)

  4. Augmenting Local Search for Satisfiability

    … by applying ESG to combinatorial auction winner determination. Further augmentations to local search are proposed and examined, exploring hybrids that incorporate aspects of backtrack search methods.

    waterloo Repository record for Augmenting Local Search for Satisfiability (opens in a new tab)

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

    … 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 and preferences on the behalf of the …

    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)

  6. Models and Algorithms for Procurement Combinatorial Auctions

    … heuristic to solve the auctioneer's winner determination problem. After generating the Lagrange multipliers from the solution of a linear relaxation, the heuristic applies several procedures to fix any potentially infeasible optimal Lagrange solutions. In addition to providing an …

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

  7. Game Theory Approaches for Transportation Problems

    … viable plan. A conflict-based formulation of the winner determination problem has been proposed, for which an effective solution approach based on a heuristic and a maximal-clique based relaxation has been presented. The second part of the dissertation examines a pessimistic bilevel toll pricing …

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

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

  9. Realiu laiku veikiančio internetinio žaidimo kūrimas su LLM pagrįstu analizės moduliu /

    … sequences, pot management, player states and winner determination, thereby reducing the risk of client-side manipulation. This separation of responsibilities ensures system integrity and stable operation. The thesis also addresses the implemented user account system. Authentication is based on …

    vilnius Repository record for Realiu laiku veikiančio internetinio žaidimo kūrimas su LLM pagrįstu analizės moduliu / (opens in a new tab)

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

    … to express their preferences for track usage. A winner determination problem is formulated, solution of which provides the optimal allocation of track capacity among carriers. The potential benefits of collaborative operation among carriers in both markets were recognized. Collaborative …

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

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

  12. An Economic Framework For Resource Management And Pricing In Wireless Networks With Competitive Service Providers

    … auctions. In this regard, we propose a winner determination sealed-bid knapsack auction mechanism that dynamically allocates spectrum to the WSPs based on their bids. As far as dynamic service pricing is concerned, we use game theory to capture the conflict of interest between WSPs and …

    ucf Repository record for An Economic Framework For Resource Management And Pricing In Wireless Networks With Competitive Service Providers (opens in a new tab)

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

    … to construct office schedules by determining the winners in an office timeslot auction. Determining which employee will receive which timeslot in the auction can be modelled as a well-known optimisation problem referred to as the winner determination problem (WDP). This problem is often found in …

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

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

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

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

  17. Security Issues in Cognitive Radio Networks

    … spectrum auction that allows verification of the winner determination and pricing phases of the VCG auction. We use maximal independent set enumeration and secure multiparty computation to solve the verification problem, while protecting privacy of wireless users. We propose different methods in …

    calgary Repository record for Security Issues in Cognitive Radio Networks (opens in a new tab)

  18. Advanced Mechanism Design for Electric Vehicle Charging Scheduling in the Smart Infrastructure

    … auction. These proposed auctions contain bids, winner determination models, and bidding procedure, with which the designer can compute high quality schedules and preserve users’ privacy by progressively eliciting their preference information as necessary. (3) Reinforcement learning-based …

    concordia Download PDF for Advanced Mechanism Design for Electric Vehicle Charging Scheduling in the Smart Infrastructure (opens in a new tab)

  19. OPEN INNOVATION CONTESTS IN ONLINE MARKETS: IDEA GENERATION AND IDEA EVALUATION WITH COLLECTIVE INTELLIGENCE

    … examining the characteristics and strategies of winners and solvers. Finally, in the third study, a new approach to the solution evaluation process is introduced, which is referred to as open evaluation. In this approach, a prediction market is used as an aggregation mechanism to coordinate the …

    temple Repository record for OPEN INNOVATION CONTESTS IN ONLINE MARKETS: IDEA GENERATION AND IDEA EVALUATION WITH COLLECTIVE INTELLIGENCE (opens in a new tab)