We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

The paper studies when efficient allocations are implementable via coalition-proof mechanisms. When ambiguous mechanisms are allowed and agents are maxmin expected utility maximizers, we prove that all efficient allocations are implementable via interim coalition incentive compatible mechanisms...

We consider situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private...

In light of recent developments in auction theory, this Article re-examines Delaware corporate law governing directors' actions when structuring the sale of a corporation. A foundational doctrine of Delaware law is that when the board of directors resolves to sell a corporation, it must obtain...

We show that charging entry fees can sometimes dominate the benefit of recruiting additional bidders to auctions, even though the fees themselves implicitly reduce competition at the auction stage. We also highlight that admission fees and reserve prices are different instruments in a setting...