Concepts inOn characterizations of truthful mechanisms for combinatorial auctions and scheduling
Combinatorial auction
A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or ¿packages,¿ rather than just individual items or continuous quantities. Simple combinatorial auctions have been used for many years in estate auctions, where a common procedure is to accept bids for packages of items.
more from Wikipedia
Algorithmic mechanism design
Algorithmic mechanism design (AMD) lies at the intersection of economic game theory and computer science. Noam Nisan and Amir Ronen, from the Hebrew University of Jerusalem, first coined "Algorithmic mechanism design" in a research paper published in 2001.
more from Wikipedia
Job shop scheduling
Job shop scheduling is an optimization problem in computer science in which ideal jobs are assigned to resources at particular times. The most basic version is as follows: We are given n jobs J1, J2, ... , Jn of varying sizes, which need to be scheduled on m identical machines, while trying to minimize the makespan. The makespan is the total length of the schedule (that is, when all the jobs have finished processing).
more from Wikipedia
Subadditivity
In mathematics, subadditivity is a property of a function that states, roughly, that evaluating the function for the sum of two elements of the domain always returns something less than or equal to the sum of the function's values at each element. There are numerous examples of subadditive functions in various areas of mathematics, particularly norms and square roots. Additive functions are special cases of subadditive functions.
more from Wikipedia