| Buyer-Supplier Games: Optimization Over the (2009) | |||||||||||||||
Abstract | |||||||||||||||
| 1 Introduction In this paper, we study the core of a large set of games, a subset of assignmentgames, which we term buyer-supplier games [3, 22] [23, Chapter 6]. We are primarily concerned with efficient computations over the set of vectors belongingto the core of buyer-supplier games. Before diving into an overview of buyersupplier games, we present some connections between our work and the existingliterature. 1.1 Related Work Though suggested by Edgeworth as early as 1881 [8], the notion of the corewas formalized by Gillies and Shapley [11, 21], extending von Neumann and | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||