The Evolution of Fairness under an Assortative Matching Rule in the Ultimatum Game

This paper studies how a matching rule affects the evolution of fairness in an ultimatum mini game. Gale et al. [1995] show that only selfish behaviour survives in the deterministic replicator dynamics under the random matching rule. In contrast, this paper shows that, under an assortative matching rule, the fair behaviour may survive at an asymptotically stable state.

Formation of Decentralized Manufacturer-Supplier Networked Market

This paper studies trading in a two-sided market where firms strategically form a network. In a networked market, manufacturers and suppliers must be connected by links for trading. We show that if no contingent contract is available, then any pairwise Nash stable network is inefficient. Each supplier under-invests in links (a hold-up problem). If a contract contingent on direct links is available and link cost is low, then the under-investment problem solves. Furthermore, the complete network resulting in the Walrasian outcome is uniquely pairwise Nash stable. However, this outcome is also inefficient. A new hold-up problem, over-investment in links, arises.

Revenue-capped efficient auctions

We study an auction that maximizes the expected social surplus under an upperbound constraint on the seller's expected revenue, which we call a revenue cap. Such a constrained-efficient auction may arise, for example, when: (i) the auction designer is "pro-buyer", that is, he maximizes the weighted sum of the buyers' and seller's auction payoffs, where the weight for the buyers is greater than that for the seller; (ii) the auction designer maximizes the (unweighted) total surplus in a multi-unit auction in which the number of units the seller owns is private information; or (iii) multiple sellers compete to attract buyers before the auction. We characterize the mechanisms for constrained-efficient auctions and identify their important properties. First, the seller sets no reserve price and sells the good for sure. Second, with a nontrivial revenue cap, "bunching" is necessary. Finally, with a sufficiently severe revenue cap, the constrained-efficient auction has a bid cap, so that bunching occurs at least "at the top," that is, "no distortion at the top" fails

Formation of Decentralized Manufacturer-Supplier Networked Market

This paper studies trading in a two-sided market where firms strategically form a network. In a networked market, manufacturers and suppliers must be connected by links for trading. We show that if no contingent contract is available, then any pairwise Nash stable network is inefficient. Each supplier under-invests in links (a hold-up problem). If a contract contingent on direct links is available and link cost is low, then the under-investment problem solves. Furthermore, the complete network resulting in the Walrasian outcome is uniquely pairwise Nash stable. However, this outcome is also inefficient. A new hold-up problem, over-investment in links, arises

Revenue-capped efficient auctions

We study an auction that maximizes the expected social surplus under an upperbound constraint on the seller's expected revenue, which we call a revenue cap. Such a constrained-efficient auction may arise, for example, when: (i) the auction designer is "pro-buyer", that is, he maximizes the weighted sum of the buyers' and seller's auction payoffs, where the weight for the buyers is greater than that for the seller; (ii) the auction designer maximizes the (unweighted) total surplus in a multi-unit auction in which the number of units the seller owns is private information; or (iii) multiple sellers compete to attract buyers before the auction. We characterize the mechanisms for constrained-efficient auctions and identify their important properties. First, the seller sets no reserve price and sells the good for sure. Second, with a nontrivial revenue cap, "bunching" is necessary. Finally, with a sufficiently severe revenue cap, the constrained-efficient auction has a bid cap, so that bunching occurs at least "at the top," that is, "no distortion at the top" fails

Revenue-capped efficient auctions

We study an auction that maximizes the expected social surplus under an upper-bound constraint on the seller’s expected revenue, which we call a revenue cap. Such a constrained-efficient auction may arise, for example, when (i) the auction designer is “pro-buyer”, that is, he maximizes the weighted sum of the buyers’ and seller’s auction payoffs, where the weight for the buyers is greater than that for the seller; (ii) the auction designer maximizes the (unweighted) total surplus in a multiunit auction in which the number of units the seller owns is private information; or (iii) multiple sellers compete to attract buyers before the auction. We characterize the mechanisms for constrained-efficient auctions and identify their important properties. First, the seller sets no reserve price and sells the good for sure. Second, with a nontrivial revenue cap, “bunching” is necessary. Finally, with a sufficiently severe revenue cap, the constrained-efficient auction has a bid cap, so that bunching occurs at least “at the top,” that is, “no distortion at the top” fails