Envy-Free and Efficient Minimal Rights: Recursive No-Envy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Envy-Free and Efficient Minimal Rights: Recursive No-Envy

In economics the main efficiency criterion is that of Pareto-optimality. For problems of distributing a social endowment a central notion of fairness is no-envy (each agent should receive a bundle at least as good, according to her own preferences, as any of the other agent’s bundle). For most economies there are multiple allocations satisfying these two properties. We provide a procedure, base...

متن کامل

Negotiating efficient envy-free divisions

Division of a resource among multiple agents is a frequent problem in multiagent systems and fair, efficient, and decentralized allocation procedures are highly valued. A division of a resource or good is envy-free when every agent believes that its share is not less than anyone else’s share by its own estimate. As envy-free procedures are not efficient (in the sense of Pareto optimality) we ha...

متن کامل

Envy-Free Makespan Approximation

We study envy-free mechanisms for assigning tasks to agents, where every task may take a different amount of time to perform by each agent, and the goal is to get all the tasks done as soon as possible (i.e., minimize the makespan). For indivisible tasks, we put forward an envy-free polynomial mechanism that approximates the minimal makespan to within a factor ofO(logm), wherem is the number of...

متن کامل

More than Envy-Free

There have been several interesting results in the literature on dividing up goods between self-interested parties such that the allocation is envy-free (Brams Taylor 1996). An allocation is deemed envy-free when every party (agent) believes that its share is not less than anyone else’s share. These procedures, however, are not efficient (in the sense of pareto optimality) general. Envy-free pr...

متن کامل

No-envy in Queueing Problems

We explore the implications of no-envy (Foley 1967) in the context of queueing problems. We identify an easy way of checking whether a rule satisfies efficiency and no-envy. The existence of such a rule can easily be established. Next, we ask whether there is a rule satisfying efficiency and noenvy together with an additional solidarity requirement: every agent should be affected in the same di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The B.E. Journal of Theoretical Economics

سال: 2009

ISSN: 1935-1704,2194-6124

DOI: 10.2202/1935-1704.1510