On optimal mechanism design for a sequencing problem
From MaRDI portal
Publication:2018936
DOI10.1007/s10951-014-0378-9zbMath1310.90052OpenAlexW2133880097MaRDI QIDQ2018936
Jelle Duives, Rudolf Müller, Marc Uetz, Birgit Heydenreich, Debasis Mishra
Publication date: 26 March 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0378-9
Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (6)
Incentives and justice for sequencing problems ⋮ Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types ⋮ Balanced VCG mechanisms for sequencing problems ⋮ Randomized mechanism design for decentralized network scheduling ⋮ Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs ⋮ Balanced implementability of sequencing rules
Cites Work
- Unnamed Item
- Simple sequencing problems with interdependent costs
- Optimization and mechanism design
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity
- An optimal auction for capacity constrained bidders: a network perspective
- A necessary and sufficient condition for rationalizability in a quasilinear context
- Sequencing games
- Dominant strategy implementation of Bayesian incentive compatible allocation rules
- On the balancedness of multiple machine sequencing games
- Weak monotonicity and Bayes-Nash incentive compatibility
- On the Equivalence of Bayesian and Dominant Strategy Implementation
- Bayesian and Dominant-Strategy Implementation in the Independent Private-Values Model
- Priority Auctions and Queue Disciplines That Depend on Processing Time
- Characterization of Revenue Equivalence
- Optimal Auction Design
- Incentives in Teams
- Optimal Multi-Object Auctions
- Two Dimensional Optimal Mechanism Design for a Sequencing Problem
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Optimal Mechanisms for Single Machine Scheduling
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
- Mechanism design in queueing problems
This page was built for publication: On optimal mechanism design for a sequencing problem