منابع مشابه
Average-case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, i...
متن کاملCompetitive Repeated Allocation without Payments
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) incentive compatible mechanisms that do not rely on payments, with the goal of maximizing expected social welfare. We first focus on the case of two agents. We introduce an artificial payment system, which enables us to ...
متن کاملOptimal allocation without transfer payments
Often an organization or government must allocate goods without collecting payment in return. This may pose a di¢ cult problem either when agents receiving those goods have private information in regards to their values or needs or when discriminating among agents using known di¤erences is not a viable option. In this paper, we nd an optimal mechanism to allocate goods when the designer is ben...
متن کاملN ov 2 01 7 Average - case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, i...
متن کاملSolutions to Cooperative Games without Side Payments
An extension of Von Neumann Morgenstern solution theory to cooperative games without side payments has been outlined in [1]. In this paper we revise some of the definitions given in [1] and prove that in the new theory every threeperson constant sum game is solvable (see [1, Theorem 1]). Other results that were formulated in [1] had already been proved in [2]. [1 ; 2] are also necessary for a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2013
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-013-9473-0