We study the query complexity of cake cutting and give lower bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. These lower bounds are tight for three players in the case of envy-free allocations and for two players in the case of perfect and equitable allocations. We also formalize moving knife procedures and show that a large subc...

Using a model of agent behavior based around envy-reducing strategies, we describe an iterated combinatorial auction in which the allocation and prices converge to a solution in the core of the agents’ true valuations. In each round of the iterative auction mechanism, agents act on envy quotes produced by the mechanism: hints that suggest the prices of the bundles they are interested in. We des...

We study the dynamic fair division of indivisible goods. Suppose T items arrive online and must be allocated upon arrival to one of n agents, each of whom has a value in [0, 1] for the current item. Our goal is to design allocation algorithms that minimize the maximum envy at time T , EnvyT , de€ned as the maximum di‚erence between any agent’s overall value for items allocated to another agent ...

We initiate the study of fairness among classes agents in online bipartite matching where there is a given set offline vertices (aka agents) and another items) that arrive must be matched irrevocably upon arrival. In this setting, are partitioned into required to fair with respect classes. adopt popular notions (e.g. envy-freeness, proportionality, maximin share) their relaxations setting deter...

This article takes up and broadens the concept of ‘womb-envy’ from a bioenergetic perspective. Womb-envy describes felt, if unconscious, experience in men arising our incapacity to carry bear and, certain ways, nurture children. paper examines this phenomenon using somatopsychic lens illuminates impact feelings on personality development men’s relationships with women.

We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a length lj and each machine i has a private speed ti. The running time of job j on machine i is tilj . We seek a mechanism that obtains speed bids of machines and then assign jobs and payments to machines so that the machine...

An economic theory of the firm must explain both when firms supplant markets and when markets supplant firms. While theories of when markets fail are well developed, the extant literature provides a less than adequate explanation of why and when hierarchies fail and of actions managers take to mitigate such failure. In this article, we seek to develop a more complete theory of the firm by theor...