Two Dimensional Optimal Mechanism Design for a Sequencing Problem

DOI10.1007/978-3-642-36694-9_21zbMath1372.90047OpenAlexW1815705819WikidataQ62044138 ScholiaQ62044138MaRDI QIDQ4910820

Ruben Hoeksma, Marc Uetz

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_21

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (5)

Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope ⋮ Decomposition Algorithm for the Single Machine Scheduling Polytope ⋮ Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types ⋮ Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs ⋮ On optimal mechanism design for a sequencing problem

This page was built for publication: Two Dimensional Optimal Mechanism Design for a Sequencing Problem