Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Social and Behavioral Sciences

Equal-Quantile Rules In Resource Allocation With Uncertain Needs, Yan Long, Jay Sethuraman, Jingyi Xue Sep 2021

Equal-Quantile Rules In Resource Allocation With Uncertain Needs, Yan Long, Jay Sethuraman, Jingyi Xue

Research Collection School Of Economics

A group of agents have uncertain needs on a resource, which must be allocated before uncertainty re-solves. We propose a parametric class of division rules we call equal-quantile rules. The parameter lambda of an equal-quantile rule is the maximal probability of satiation imposed on agents - for each agent, the prob-ability that his assignment is no less than his realized need is at most lambda. It determines the extent to which the resource should be used to satiate agents. If the resource is no more than the sum of the agents' lambda-quantile assignments, it is fully allocated and the rule …


Are Simple Mechanisms Optimal When Agents Are Unsophisticated?, Jiangtao Li, Piotr Dworczak Jul 2021

Are Simple Mechanisms Optimal When Agents Are Unsophisticated?, Jiangtao Li, Piotr Dworczak

Research Collection School Of Economics

We study the design of mechanisms involving agents that have limited strategic sophistication. The literature has identified several notions of simple mechanisms in which agents can determine their optimal strategy even if they lack cognitive skills such as predicting other agents' strategies (strategy-proof mechanisms), contingent reasoning (obviously strategy-proof mechanisms), or foresight (strongly obviously strategy-proof mechanisms). We examine whether it is optimal for the mechanism designer who faces strategically unsophisticated agents to offer a mechanism from the corresponding class of simple mechanisms. We show that when the designer uses a mechanism that is not simple, while she loses the ability to …


Government Support For Smes In Response To Covid-19: Theoretical Model Using Wang Transform, Shaun Shuxun Wang, Jing Rong Goh, Didier Sornette, He Wang, Esther Yang Jul 2021

Government Support For Smes In Response To Covid-19: Theoretical Model Using Wang Transform, Shaun Shuxun Wang, Jing Rong Goh, Didier Sornette, He Wang, Esther Yang

Research Collection School Of Economics

Purpose: Many governments are taking measures in support of small and medium-sized enterprises (SMEs) to mitigate the economic impact of the COVID-19 outbreak. This paper presents a theoretical model for evaluating various government measures, including insurance for bank loans, interest rate subsidy, bridge loans and relief of tax burdens. Design/methodology/approach: This paper distinguishes a firm's intrinsic value and book value, where a firm can lose its intrinsic value when it encounters cash-flow crunch. Wang transform is applied to (1) calculating the appropriate level of interest rate subsidy payable to incentivize banks to issue more loans to SMEs and to extend …


Competitive Information Disclosure In Random Search Markets, Wei He, Jiangtao Li Jun 2021

Competitive Information Disclosure In Random Search Markets, Wei He, Jiangtao Li

Research Collection School Of Economics

We analyze the role of competition in information provision in random search markets. Multiple symmetric senders compete for the receiver’s investment by disclosing information about their respective project qualities, and the receiver conducts random search to learn about the qualities of the projects. We show that in any symmetric Nash equilibrium, each sender chooses a strategy with the lowest possible reservation value. The receiver does not benefit from the competition of the senders, as the receiver’s expected payoff does not change when the number of senders increases.


On The Decomposability Of Fractional Allocations, Shurojit Chatterji, Peng Liu Apr 2021

On The Decomposability Of Fractional Allocations, Shurojit Chatterji, Peng Liu

Research Collection School Of Economics

A common practice in dealing with the allocation of indivisible objects is to treat them as infinitely divisible and specify a fractional allocation, which is then implemented as a lottery on integer allocations that are feasible. The question we study is whether an arbitrary fractional allocation can be decomposed as a lottery on an arbitrary set of feasible integer allocations. The main result is a characterization of decomposable fractional allocations, that is obtained by transforming the decomposability problem into a maximum flow problem. We also provide a separate necessary condition for decomposability.


On Incentive Compatible, Individually Rational Public Good Provision Mechanisms, Takashi Kunimoto, Cuiling Zhang Mar 2021

On Incentive Compatible, Individually Rational Public Good Provision Mechanisms, Takashi Kunimoto, Cuiling Zhang

Research Collection School Of Economics

This paper characterizes mechanisms satisfying incentive compatibility and individual rationality in the classical public good provision problem. Many papers in the literature obtain the results in the so-called standard model of ex ante identical agents with a continuous, closed interval of types. The main contribution of this paper is the characterization of the budget-surplus maximizing mechanism satisfying incentive compatibility and individual rationality (Theorem 1 for Bayesian implementation and Theorem 3 for dominant strategy implementation) that applies to a finite discretization over the standard model. Making use of the proposed budget-surplus maximizing mechanisms, we show that some known results do not …


A Theory Of Revealed Indirect Preference, Gaoji Hu, Jiangtao Li, John K.-H. Quah, Rui Tang Jan 2021

A Theory Of Revealed Indirect Preference, Gaoji Hu, Jiangtao Li, John K.-H. Quah, Rui Tang

Research Collection School Of Economics

A preference over menus is said to be an indirect preference if it is induced by a preference over the objects that make up those menus, i.e., a menu A is ranked over B whenever A contains an object that is preferred to every object in B. The basic question we address in this paper is the following: suppose an observer has partial information of an agent’s ranking over certain menus; what necessary and sufficient conditions on those rankings guarantee the existence of a preference over objects that induces the observed menu rankings? Our basic result has a wide variety …