Stability of Generalized Two-sided Markets with Transaction Thresholds

We study a type of generalized two-sided markets where a set of sellers, each with multiple units of the same divisible good, trade with a set of buyers. Possible trade of each unit between a buyer and a seller generates a given welfare (to be split among them), indicated by the weight of the edge between them. What makes the markets interesting is a special type of constraints, called transaction threshold constraints, which essentially mean that the amount of goods traded between a pair of agents can either be zero or above a certain edge-specific threshold. This constraints has originally been motivated from the water-right market domain by Liu et. al. where minimum thresholds must be imposed to mitigate administrative and other costs. The same constraints have been witnessed in several other market domains. Without the threshold constraints, it is known that the seminal result by Shapley and Shubick holds: the social welfare maximizing assignments between buyers and sellers are in the core. In other words, by algorithmically optimizing the market, one can obtain desirable incentive properties for free. This is no longer the case for markets with threshold constraints: the model considered in this paper. We first demonstrate a counterexample where no optimal assignment (with respect to any way to split the trade welfare) is in the core. Motivated by this observation, we study the stability of the optimal assignments from the following two perspectives: 1) by relaxing the definition of core; 2) by restricting the graph structure. For the first line, we show that the optimal assignments are pairwise stable, and no coalition can benefit twice as large when they deviate. For the second line, we exactly characterize the graph structure for the nonemptyness of core: the core is nonempty if and only if the market graph is a tree. Last but not least, we compliment our previous results by quantitatively measuring the welfare loss caused by the threshold constraints: the optimal welfare without transaction thresholds is no greater than constant times of that with transaction thresholds. We evaluate and confirm our theoretical results using real data from a water-right market.

[1]  E. H. Clarke Multipart pricing of public goods , 1971 .

[2]  Jorge Oviedo,et al.  The core of a further m-sided assignment game , 1997 .

[3]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[4]  Éva Tardos,et al.  Trading networks with price-setting agents , 2007, EC '07.

[5]  Alvin E. Roth,et al.  The assignment game , 1990 .

[6]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[7]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[8]  Gabrielle Demange,et al.  On Group Stability in Hierarchies and Networks , 2004, Journal of Political Economy.

[9]  V. Crawford,et al.  Job Matching with Heterogeneous Firms and Workers , 1981 .

[10]  Pingzhong Tang,et al.  Internally Stable Matchings and Exchanges , 2014, AAAI.

[11]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

[12]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[13]  Pingzhong Tang,et al.  Facility Location with Minimax Envy , 2016, IJCAI.

[14]  Edith Elkind,et al.  Bounding the Cost of Stability in Games over Interaction Networks , 2013, AAAI.

[15]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[16]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[17]  Tingting Xu,et al.  Optimizing Trading Assignments in Water Right Markets , 2016, AAAI.

[18]  Adrian Vetta,et al.  Coalition Games on Interaction Graphs: A Horticultural Perspective , 2015, EC.

[19]  Makoto Yokoo,et al.  False-Name-Proof Locations of Two Facilities: Economic and Algorithmic Approaches , 2016, AAAI.

[20]  V. Crawford,et al.  Job Matching, Coalition Formation, and Gross Substitutes , 1982 .

[21]  L. Shapley,et al.  On cores and indivisibility , 1974 .

[22]  Robert J. Aumann,et al.  AN AXIOMATIZATION OF THE NON-TRANSFERABLE UTILITY VALUE , 1985 .

[23]  Minming Li,et al.  Strategy-proof Mechanism Design for Facility Location Games: Revisited (Extended Abstract) , 2016, AAMAS.

[24]  Thomas Quint,et al.  The core of an m-sided assignment game , 1991 .

[25]  L. Shapley,et al.  The assignment game I: The core , 1971 .