Bayesian optimal knapsack procurement

DOI10.1016/j.ejor.2013.09.031zbMath1304.91048OpenAlexW3123359982MaRDI QIDQ2514780

Ludwig Ensthaler, Thomas Giebe

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.031

zbMATH Keywords

game theoryknapsack problemmechanism designbudgetprocurementsubsidies

Mathematics Subject Classification ID

Applications of game theory (91A80) Combinatorial optimization (90C27) Stochastic games, stochastic differential games (91A15) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (7)

Optimum attributes component test plans for \(k\)-out-of-\(n:F\) Weibull systems using prior information ⋮ Ex-post optimal knapsack procurement ⋮ Innovation contests with entry auction ⋮ On the Stackelberg knapsack game ⋮ Budget Feasible Procurement Auctions ⋮ Auction mechanisms for allocating subsidies for carbon emissions reduction: an experimental investigation ⋮ A Stackelberg knapsack game with weight control

Cites Work

• Selfish routing in public services
• Incentive based energy market design
• Pareto optimality, game theory and equilibria
• A note on budget balance under interim participation constraints: The case of independent types
• Pricing combinatorial auctions.
• Avoiding non-optimal management decisions by applying a three-person inspection game
• Contract design and supply chain coordination in the electricity industry
• Dynamic pricing when consumers are strategic: analysis of posted and contingent pricing schemes
• Distributing inspections in space and time -- proposed solution of a difficult problem
• Strategic Behavior and Social Optimization in Markovian Vacation Queues
• Optimal Lower Bounds for Anonymous Scheduling Mechanisms
• TECHNICAL NOTE—Decentralized Inventory Sharing with Asymmetric Information
• Revenue maximization in the dynamic knapsack problem
• Mechanism Design for Decentralized Online Machine Scheduling
• Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
• Simultaneous Ad Auctions
• Dynamic Mechanism Design for Online Commerce
• Knapsack auctions
• Game Theory and Operations Research: Some Musings 50 Years Later
• Regulating a Monopolist with Unknown Costs
• Optimal Auction Design
• Optimal Dynamic Auctions and Simple Index Rules
• Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising

This page was built for publication: Bayesian optimal knapsack procurement