Fetching the paper…
Reading the bibliography…
In this paper, we present a unifying framework for analyzing equilibria and designing interventions for large network games sampled from a stochastic network formation process represented by a graphon.
Existence and uniqueness of equilibrium points for concave n-person games
Rosen, J. B. (1965) · 1965
Earlier work this paper cites.
Equilibrium points of nonatomic games
Schmeidler, D. (1973) · 1973
Earlier work this paper cites.
Fixed point theorems
Smart, D. R. (1974) · 1974
Earlier work this paper cites.
The existence, uniqueness and stability of traffic equilibria
Smith, M. J. (1979) · 1979
Earlier work this paper cites.
Nonlinear Functional Analysis and its Applications: Part 1: Fixed-Point Theorems
Zeidler, E. (1985) · 1985
Earlier work this paper cites.
Equilibrium points of nonatomic games over a banach space
Khan, M. A. (1986) · 1986
Earlier work this paper cites.
Network economics: A variational inequality approach
Nagurney, A. (1993) · 1993
Earlier work this paper cites.
Spatial social networks
Johnson, C. and Gilles, R. P. (2003) · 2003
Earlier work this paper cites.
Convex optimization
Boyd, S. and Vandenberghe, L. (2004) · 2004
Earlier work this paper cites.
Large robust games
Kalai, E. (2004) · 2004
Earlier work this paper cites.
Best response dynamics in finite games with additive aggregation
Kukushkin, N. S. (2004) · 2004
Earlier work this paper cites.
Applications of functional analysis and operator theory
Hutson, V., Pym, J., and Cloud, M. (2005) · 2005
Earlier work this paper cites.
The economics of small worlds
Jackson, M. O. and Rogers, B. W. (2005) · 2005
Earlier work this paper cites.
Complementarities and games: New developments
Vives, X. (2005) · 2005
Earlier work this paper cites.
Infinite Dimensional Analysis A Hitchhiker’s Guide
Aliprantis, C. D. and Border, K. C. (2006) · 2006
Earlier work this paper cites.
A survey on networking games in telecommunications
Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., and Wynter, L. (2006) · 2006
Earlier work this paper cites.
Who’s who in networks. Wanted: The key player
Ballester, C., Calvó-Armengol, A., and Zenou, Y. (2006) · 2006
Earlier work this paper cites.
Strategic complements and substitutes, and potential games
Dubey, P., Haimanko, O., and Zapechelnyuk, A. (2006) · 2006
Earlier work this paper cites.
Limits of dense graph sequences
Lovász, L. and Szegedy, B. (2006) · 2006
Earlier work this paper cites.
Public goods in networks
Bramoullé, Y. and Kranton, R. (2007) · 2007
Earlier work this paper cites.
Large-population cost-coupled LQG problems with nonuniform agents: Individual-mass behavior and decentralized ε \varepsilon -Nash equilibria
Huang, M., Caines, P. E., and Malhamé, R. P. (2007) · 2007
Earlier work this paper cites.
Mean field games
Lasry, J.-M. and Lions, P.-L. (2007) · 2007
Earlier work this paper cites.
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T., and Vesztergombi, K. (2008) · 2008
Cited alongside, same era.
Identification of peer effects through social networks
Bramoullé, Y., Djebbari, H., and Fortin, B. (2009) · 2009
Cited alongside, same era.
Network games
Galeotti, A., Goyal, S., Jackson, M. O., Vega-Redondo, F., and Yariv, L. (2010) · 2010
Cited alongside, same era.
Aggregative games and best-reply potentials
Jensen, M. K. (2010) · 2010
Cited alongside, same era.
Population games and evolutionary dynamics
Sandholm, W. H. (2010) · 2010
Cited alongside, same era.
Convex optimization, game theory, and variational inequality theory
Scutari, G., Palomar, D. P., Facchinei, F., and Pang, J.-S. (2010) · 2010
Cited alongside, same era.
Econometrics of sampled networks
Chandrasekhar, A. and Lewis, R. (2016) · 2016
Later among the works it cites.
Graphons, mergeons, and so on!
Eldridge, J., Belkin, M., and Wang, Y. (2016) · 2016
Later among the works it cites.
Distributions of centrality on networks
Dasaratha, K. (2017) · 2017
Later among the works it cites.
Targeting interventions in networks
Galeotti, A., Golub, B., and Goyal, S. (2017) · 2017
Later among the works it cites.
The control of arbitrary size networks of linear systems via graphon limits: An initial investigation
Gao, S. and Caines, P. E. (2017) · 2017
Later among the works it cites.
Unifying framework for crowd-sourcing via graphon estimation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Limits of randomly grown graph sequences
Borgs, C., Chayes, J., Lovász, L., Sós, V., and Vesztergombi, K. (2011) · 2011
Cited alongside, same era.
On the spectra of general random graphs
Chung, F. and Radcliffe, M. (2011) · 2011
Cited alongside, same era.
Fully aggregative games
Cornes, R. and Hartley, R. (2012) · 2012
Cited alongside, same era.
Large networks and graph limits
Lovász, L. (2012) · 2012
Cited alongside, same era.
Juvenile delinquency and conformism
Patacchini, E. and Zenou, Y. (2012) · 2012
Cited alongside, same era.
Aggregate comparative statics
Acemoglu, D. and Jensen, M. K. (2013) · 2013
Cited alongside, same era.
Lee, C. E. and Shah, D. (2017) · 2017
Later among the works it cites.
Signal processing on kernel-based random graphs
Morency, M. W. and Leus, G. (2017) · 2017
Later among the works it cites.
Just a few seeds more: value of network information for diffusion
Akbarpour, M., Malladi, S., and Saberi, A. (2018) · 2018
Closest in time.
Centrality measures for graphons: Accounting for uncertainty in networks
Avella-Medina, M., Parise, F., Schaub, M., and Segarra, S. (Aug 2018) · 2018
Closest in time.
Using aggregated relational data to feasibly identify network structure without network data
Breza, E., Chandrasekhar, A. G., McCormick, T. H., and Pan, M. (2018) · 2018
Closest in time.
Graphon mean field games and the GMFG equations
Caines, P. E. and Huang, M. (2018) · 2018
Closest in time.
Recovering social networks from panel data: identification, simulations and an application
De Paula, A., Rasul, I., and Souza, P. (2018) · 2018
Closest in time.
Parise, F. and Ozdaglar, A. (2018) · 2018
Closest in time.
Using gossips to spread information: Theory and evidence from two randomized controlled trials
Banerjee, A., Chandrasekhar, A. G., Duflo, E., and Jackson, M. O. (2019) · 2019
Closest in time.
An L p {L}^{p} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
Borgs, C., Chayes, J., Cohn, H., and Zhao, Y. (2019) · 2019
Closest in time.
Estimating peer effects using partial network data
Boucher, V. and Houndetoungan, A. (2019) · 2019
Closest in time.
Behavioral communities and the atomic structure of networks
Jackson, M. O. and Storms, E. (2019) · 2019
Closest in time.
Social networks with misclassified or unobserved links
Lewbel, A., Qu, X., and Tang, X. (2019) · 2019
Closest in time.
A variational inequality framework for network games: Existence, uniqueness, convergence and sensitivity analysis
Parise, F. and Ozdaglar, A. (2019) · 2019
Closest in time.
Diffusion games
Sadler, E. (2020) · 2020
Closest in time.
Social norms in networks
Ushchev, P. and Zenou, Y. (2020) · 2020
Closest in time.