Bayesian optimal knapsack procurement

DOI10.1016/J.EJOR.2013.09.031MaRDI QIDQ2514780zbMATH OpenOpenAlexFDO

Authors 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 designprocurementbudgetsubsidies

Mathematics Subject Classification ID

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

Recommendations

• Ex-post optimal knapsack procurement
• Budget feasible procurement auctions
• Probabilistic procurement auctions
• Truthful multi-unit procurements with budgets
• A simple mechanism for a budget-constrained buyer

Cites work

• A note on budget balance under interim participation constraints: The case of independent types
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Avoiding non-optimal management decisions by applying a three-person inspection game
• Contract design and supply chain coordination in the electricity industry
• Decentralized inventory sharing with asymmetric information
• Distributing inspections in space and time -- proposed solution of a difficult problem
• Dynamic Mechanism Design for Online Commerce
• Dynamic pay-per-action mechanisms and applications to online advertising
• Dynamic pricing when consumers are strategic: analysis of posted and contingent pricing schemes
• Game Theory and Operations Research: Some Musings 50 Years Later
• Incentive based energy market design
• Knapsack auctions
• Mechanism design for decentralized online machine scheduling
• Optimal Auction Design
• Optimal dynamic auctions and simple index rules
• Optimal lower bounds for anonymous scheduling mechanisms
• Pareto optimality, game theory and equilibria
• Pricing combinatorial auctions.
• Regulating a Monopolist with Unknown Costs
• Revenue maximization in the dynamic knapsack problem
• Selfish routing in public services
• Simultaneous ad auctions
• Strategic behavior and social optimization in Markovian vacation queues

Cited in

(7)

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

This page was built for publication: Bayesian optimal knapsack procurement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514780)