In a mechanism design setting with quasilinear preferences, a domain dd of admissible valuations of an agent is called a monotonicity domain if every 2-cycle monotone allocation rule is truthfully implementable (in dominant strategies). Dd is called a revenue equivalence domain if every implementable allocation rule satisfies revenue equivalence. Carbajal and müller (2015) introduced the notions of monotonic transformations in differences and showed that if dd admits these transformations then it is a revenue equivalence and monotonicity domain. Here, we show that various economic domains, with countable or uncountable allocation sets, admit monotonic transformations in differences. Our applications include public and private supply of divi...
Day and Milgrom (Int J Game Theory 36:393-407, 2008) argue that package auctions that select the sel...
A social choice function may or may not satisfy a desirable property depending on its domain of defi...
Maximizing the revenue from selling two or more goods has been shown to require the use of $nonmonot...
In a mechanism design setting with quasilinear preferences, a domain dd of admissible valuations of ...
In a social choice setting with quasilinear preferences and monetary transfers, a domain D of admiss...
We study a new monotonicity problem in combinatorial auctions called goods revenue monotonicity, whi...
Consider an environment with a finite number of alternatives, and agents with private values and qua...
Consider an environment with a finite number of alternatives, and agents with pri-vate values and qu...
The Muller-Satterthwaite Theorem (J Econ Theory 14:412-418, 1977) establishes the equivalence betwee...
We study mechanism design problems in quasi-linear environments where the en-velope theorem and reve...
In a setting where agents have quasi-linear utilities over social alternatives and a transferable co...
We study the existnce of core selections which satisfy the cost monotonicity property in economies w...
In combinatorial auctions using VCG, a seller can sometimes increase revenue by dropping bidders. In...
Consider the problem of maximizing the revenue from selling a number of goods to a single buyer. We ...
Day and Milgrom (Int J Game Theory 36:393-407, 2008) argue that package auctions that select the sel...
A social choice function may or may not satisfy a desirable property depending on its domain of defi...
Maximizing the revenue from selling two or more goods has been shown to require the use of $nonmonot...
In a mechanism design setting with quasilinear preferences, a domain dd of admissible valuations of ...
In a social choice setting with quasilinear preferences and monetary transfers, a domain D of admiss...
We study a new monotonicity problem in combinatorial auctions called goods revenue monotonicity, whi...
Consider an environment with a finite number of alternatives, and agents with private values and qua...
Consider an environment with a finite number of alternatives, and agents with pri-vate values and qu...
The Muller-Satterthwaite Theorem (J Econ Theory 14:412-418, 1977) establishes the equivalence betwee...
We study mechanism design problems in quasi-linear environments where the en-velope theorem and reve...
In a setting where agents have quasi-linear utilities over social alternatives and a transferable co...
We study the existnce of core selections which satisfy the cost monotonicity property in economies w...
In combinatorial auctions using VCG, a seller can sometimes increase revenue by dropping bidders. In...
Consider the problem of maximizing the revenue from selling a number of goods to a single buyer. We ...
Day and Milgrom (Int J Game Theory 36:393-407, 2008) argue that package auctions that select the sel...
A social choice function may or may not satisfy a desirable property depending on its domain of defi...
Maximizing the revenue from selling two or more goods has been shown to require the use of $nonmonot...