We consider a profit maximization problem when pricing a set of m items which can be represented as the edges of an undirected multi graph G. There is a set of n customers, each of which is interested in purchasing a bundle of edges of G, and we assume that these edges form a simple path in G....

We consider a revenue maximization problem where we are selling a set of m items, each of which available in a certain quantity (possibly unlimited) to a set of n bidders. Bidders are single minded, that is, each bidder requests exactly one subset, or bundle of items. Each bidder has a valuation...

The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers with known valuations. The problem is (weakly) NP-hard and a recent quasi-PTAS suggests that a PTAS might be in reach. Yet, so...

Consider a situation in which a company sells several different items to a set of customers. However, the company is not satisfied with the current pricing strategy and wishes to implement new prices for the items. Implementing these new prices in one single step mightnot be desirable, for...

We consider machine scheduling problems where jobs have to be processed on unrelated parallel machines in order to minimize the schedule makespan. The processing time of any job is dependent on the usage of a scarce resource that can be distributed over the jobs in process. The more of that...

The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers with known valuations. The problem is (weakly) NP-hard and a recent quasi-PTAS suggests that a PTAS might be in reach. Yet, so...

We study the problem of scheduling maintenance services. Given is a set of mmachines and integral cost-coefficients ai and bi for each machine i (1 i m). Timeis discretized into unit-length periods; in each period at most one machine can beserviced at a given service cost bi. The operating...

Mixed model assembly systems assemble products (parts) of differenttypes in certain prespecified quantities. A minimal part set is a smallestpossible set of product type quantities, to be called the multiplicities,in which the numbers of assembled products of the various types are inthe desired...

We consider the problem to price (digital) items in order to maximize the revenue obtainable from a set of bidders. We suggest a natural monotonicity constraint on bundle prices, show that the problem remains NP-hard, and we derive a PTAS. We also discuss a special case, the highway pricing problem.