Allocating raw materials to competing projects

Abstract This paper considers the problem of material allocation to competing self-interested agents. A novel resource allocation model is presented and studied in a mechanism design setting without using money as incentive. The novelties and specialties of our contribution include that the materials are supplied at different dates, the jobs requiring them are related with precedence relations, and the utilities of the agents are based on the tardiness values of their jobs. We modify a classical scheduling algorithm for implementing the Serial Dictatorship Mechanism, which is then proven to be truthful and Pareto-optimal.

[1]  Xinhui Wang,et al.  Supply chain contract mechanism under bilateral information asymmetry , 2017, Comput. Ind. Eng..

[2]  Shaddin Dughmi,et al.  Truthful assignment without money , 2010, EC '10.

[3]  Péter Györgyi,et al.  Approximation schemes for parallel machine scheduling with non-renewable resources , 2017, Eur. J. Oper. Res..

[4]  Tao Qin,et al.  Efficient Mechanism Design for Online Scheduling , 2016, J. Artif. Intell. Res..

[5]  Pieter Leyman,et al.  Payment models and net present value optimization for resource-constrained project scheduling , 2016, Comput. Ind. Eng..

[6]  A. Márkus,et al.  An agent model for incentive-based production scheduling , 2000 .

[7]  Ariel D. Procaccia,et al.  No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.

[8]  Julián Mestre,et al.  Parametrized algorithms for random serial dictatorship , 2014, Math. Soc. Sci..

[9]  Katarína Cechlárová,et al.  Pareto optimal matchings with lower quotas , 2017, Math. Soc. Sci..

[10]  Elias Koutsoupias,et al.  Mechanism Design for Scheduling , 2009, Bull. EATCS.

[11]  Péter Györgyi,et al.  Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints , 2019, J. Sched..

[12]  Carmine Ventre,et al.  Mechanisms for multi-unit combinatorial auctions with a few distinct goods , 2013, AAMAS.

[13]  Jrg Rothe,et al.  Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division , 2015, Economics and Computation.

[14]  Alexander H. G. Rinnooy Kan,et al.  Scheduling subject to nonrenewable-resource constraints , 1982, Oper. Res. Lett..

[15]  Makoto Yokoo,et al.  Controlled School Choice with Soft Bounds and Overlapping Types , 2015, AAAI.

[16]  Péter Györgyi,et al.  Approximability of scheduling problems with resource consuming jobs , 2015, Ann. Oper. Res..

[17]  Nicholas R. Jennings,et al.  An Online Mechanism for Multi-Unit Demand and its Application to Plug-in Hybrid Electric Vehicle Charging , 2013, J. Artif. Intell. Res..

[18]  Elias Koutsoupias,et al.  The Anarchy of Scheduling Without Money , 2016, SAGT.

[19]  Péter Györgyi,et al.  Reductions between scheduling problems with non-renewable resources and knapsack problems , 2015, Theor. Comput. Sci..

[20]  József Váncza,et al.  A distributed coordination mechanism for supply networks with asymmetric information , 2013, Eur. J. Oper. Res..

[21]  Atila Abdulkadiroglu,et al.  RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .

[22]  Siwei Chen,et al.  House allocation when availability of houses may change unexpectedly , 2016, Math. Soc. Sci..

[23]  Vincent Conitzer,et al.  Handbook of Computational Social Choice , 2016 .

[24]  Tamás Kis,et al.  Approximability of total weighted completion time with resource consuming jobs , 2015, Oper. Res. Lett..

[25]  David Manlove,et al.  Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.

[26]  Rudolf Müller,et al.  Games and Mechanism Design in Machine Scheduling—An Introduction , 2007 .

[27]  Sabah U. Randhawa,et al.  Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs , 1997 .

[28]  József Váncza,et al.  Channel coordination with the newsvendor model using asymmetric information , 2012 .

[29]  Alexander A. Lazarev,et al.  Single machine scheduling problems with financial resource constraints: Some complexity results and properties , 2011, Math. Soc. Sci..

[30]  Alexander Grigoriev,et al.  Basic Scheduling Problems with Raw Material Constraints , 2005 .

[31]  Morteza Rasti Barzoki,et al.  Multi-agent supply chain scheduling problem by considering resource allocation and transportation , 2019, Comput. Ind. Eng..

[32]  Péter Györgyi,et al.  Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut , 2018, Comput. Ind. Eng..

[33]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[34]  David Manlove,et al.  Pareto Optimal Matchings in Many-to-Many Markets with Ties , 2015, Theory of Computing Systems.