The recent ellipsoidal method for solving linear programs due to Khachian and Shor is shown to process linear complementarity problems with positive semidefinite matrix. Suitable modifications of all lemmas are presented and it is shown that the algorithm operates in polynomial time of the same...

In this paper, we provide axiomatic foundations for social choice rules on a domain of convex and comprehensive social choice problems when agents have cardinal utility functions. We translate the axioms of three well known approaches in bargaining theory (Nash 1950; Kalai and Smorodinsky 1975; Kalai...

This chapter surveys a class of solution concepts for n-person games without transferable utility -- NTU games for short -- that are based on varying notions of "fair division". An NTU game is a specification of payoffs attainable by members of each coalition through some joint course of action....

In this paper we consider the question of allocating costs and setting prices for customers in a variety of queuing systems. We will focus on the problem of setting users fees within an organization for a shared resource, such as a computer center. We argue that both the Aumann-Shapley pricing...

Cost allocation problems arise in many contexts in economics and management science. In a typical problem that we have in mind, a decision maker must decide how to allocate the joint cost of production among several commodities using prices. Furthermore, these prices must satisfy certain...