Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English...

In many real-life house allocation problems, rents are bounded from above by price ceilings imposed by a government or a local administration. This is known as rent control. Because some price equilibria may be disqualified given such restrictions, this paper proposes an alternative equilibrium...

This paper explores situations where tenants in public houses, in a specific neighborhood, are given the legislated right to buy the houses they live in or can choose to remain in their houses and pay the regulated rent. This type of legislation has been passed in many European countries in the...

This paper explores the situation when tenants in public houses, in a specific neighborhood, are given the legislated right to buy the houses they live in but can choose to remain in their houses and pay the regulated rent. This type of legislation has been passed in many European countries in...

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey–English–Dutch auction and it contains the...

We consider envy-free and budget-balanced rules that are least manipulable with respect to agents counting or with respect to utility gains, and observe that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via agent-k-linked...

We consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via...

We consider envy-free and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In finite economies, we identify under classical preferences each agent’s maximal gain from manipulation. Using this...

A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent’s bundle. Under fairness, efficiency is equivalent to budget-balance...