Bargaining dynamics in exchange networks
暂无分享,去创建一个
[1] Dilip Abreu,et al. Markov Equilibria in a Model of Bargaining in Networks , 2011, Games Econ. Behav..
[2] Mihai Manea,et al. Bargaining in Stationary Networks , 2011 .
[3] Dilip Abreu,et al. Bargaining and Efficiency in Networks , 2010, J. Econ. Theory.
[4] Yashodhan Kanoria,et al. An FPTAS for Bargaining Networks with Unequal Bargaining Powers , 2010, WINE.
[5] Tanmoy Chakraborty,et al. A behavioral study of bargaining in social networks , 2010, EC '10.
[6] Nicole Immorlica,et al. The Cooperative Game Theory Foundations of Network Bargaining Games , 2010, ICALP.
[7] Yashodhan Kanoria,et al. Fast convergence of natural bargaining dynamics in exchange networks , 2010, SODA '11.
[8] Eyal Winter,et al. Endogenous Two-Sided Markets with Repeated Transactions , 2010 .
[9] Devavrat Shah,et al. Belief Propagation for Min-Cost Network Flow: Convergence and Correctness , 2010, Oper. Res..
[10] Yashodhan Kanoria,et al. On the deletion channel with small deletion probability , 2009, 2010 IEEE International Symposium on Information Theory.
[11] Yashodhan Kanoria,et al. A Natural Dynamics for Bargaining on Exchange Networks , 2009, ArXiv.
[12] Yuval Peres,et al. Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[13] Sanjeev Khanna,et al. Network bargaining: algorithms and structural results , 2009, EC '09.
[14] Christos H. Papadimitriou,et al. On oblivious PTAS's for nash equilibrium , 2009, STOC '09.
[15] C. Borgs,et al. On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs , 2008, 0807.3159.
[16] J. Kleinberg,et al. Balanced outcomes in social exchange networks , 2008, STOC.
[17] M. Bayati,et al. Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality , 2008, IEEE Transactions on Information Theory.
[18] Dmitry M. Malioutov,et al. Linear programming analysis of loopy belief propagation for weighted matching , 2007, NIPS.
[19] Arnold Polanski,et al. Bilateral bargaining in networks , 2007, J. Econ. Theory.
[20] Bert Huang,et al. Loopy Belief Propagation for Bipartite Maximum Weight b-Matching , 2007, AISTATS.
[21] Devavrat Shah,et al. Maximum weight matching via max-product belief propagation , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[22] Margarida Corominas-Bosch,et al. Bargaining in a network of buyers and sellers , 2004, J. Econ. Theory.
[23] Jeroen Kuipers,et al. On the computation of the nucleolus of a cooperative game , 2001, Int. J. Game Theory.
[24] J. Lucas,et al. Lines of Power in Exchange Networks , 2001 .
[25] U. Kohlenbach. A QUANTITATIVE VERSION OF A THEOREM DUE TO BORWEIN-REICH-SHAFRIR , 2001 .
[26] R. Kranton,et al. A Theory of Buyer-Seller Networks , 2001 .
[27] William J. Cook,et al. Combinatorial optimization , 1997 .
[28] David Willer,et al. Exclusion and Power: a Test of Four Theories of Power in Exchange Networks , 1993 .
[29] Karen S. Cook,et al. Power in exchange networks: a power-dependence formulation , 1992 .
[30] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.
[31] D. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .
[32] Douglas Gale,et al. Limit theorems for markets with sequential bargaining , 1987 .
[33] Vincent P. Crawford,et al. Bargaining and Competition in Matching Markets , 1986 .
[34] Sharon C. Rochford,et al. Symmetrically pairwise-bargained allocations in an assignment market , 1984 .
[35] Bengt Aspvall,et al. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[36] M. Edelstein,et al. Nonexpansive Mappings, Asymptotic Regularity and Successive Approximations , 1978 .
[37] J. Rubin,et al. The social psychology of bargaining and negotiation , 1975 .
[38] E. Kalai,et al. OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .
[39] L. Shapley,et al. The assignment game I: The core , 1971 .
[40] R. Stearns. Convergent transfer schemes for $N$-person games , 1968 .
[41] Peter Secretan. Learning , 1965, Mental Health.
[42] F. Spitzer. Principles Of Random Walk , 1965 .
[43] W. R. Mann,et al. Mean value methods in iteration , 1953 .
[44] Norman Braun,et al. A Nash bargaining model for simple exchange networks , 2006, Soc. Networks.
[45] D. Fudenberg,et al. The Theory of Learning in Games , 1998 .
[46] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[47] A. Kartsatos. Theory and applications of nonlinear operators of accretive and monotone type , 1996 .
[48] R. Rob,et al. Learning, Mutation, and Long Run Equilibria in Games , 1993 .
[49] Ariel Rubinstein,et al. Decentralized Trading, Strategic Behaviour and the Walrasian Outcome , 1990 .
[50] Ken Binmore,et al. Matching and Bargaining in Dynamic Markets , 1988 .
[51] A. Rubinstein,et al. Equilibrium in a market with sequential bargaining , 1985 .
[52] A. Rubinstein,et al. The Nash bargaining solution in economic modelling , 1985 .
[53] A. Rubinstein. Perfect Equilibrium in a Bargaining Model , 1982 .
[54] S. Ishikawa. Fixed points and iteration of a nonexpansive mapping in a Banach space , 1976 .