Identification and Estimation of Large Network Games with Private Link Information
ABSTRACT We study the identification and estimation of large network games in which individuals choose continuous actions while holding private information about their links and payoffs. Extending the framework of Galeotti et al., we build a tractable empirical model of such network games and show that the parameters in individual payoffs are ...
Hülya Eraslan, Xun Tang
wiley +1 more source
Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers. [PDF]
Quinton FA +4 more
europepmc +1 more source
THE ESCULTURA FORMULAS: A UNIFIED FRAMEWORK FOR GENERATING ALL ADDITIVE PARTITIONS OF INTEGERS
Escultura, Antonio
openalex +1 more source
On Spatial Point Processes With Composition‐Valued Marks
Summary Methods for marked spatial point processes with scalar marks have seen extensive development in recent years. While the impressive progress in data collection and storage capacities has yielded an immense increase in spatial point process data with highly challenging non‐scalar marks, methods for their analysis are not equally well developed ...
Matthias Eckardt +2 more
wiley +1 more source
Fractional modeling of hepatitis B virus transmission via heterosexual and homosexual contacts and its disability burden. [PDF]
Guedri K +5 more
europepmc +1 more source
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia +2 more
wiley +1 more source
Enhancing rabies epidemic modeling with neural networks and fractional calculus. [PDF]
Shafqat R +3 more
europepmc +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source
Inhomogeneous graph trend filtering via a l 2,0 -norm cardinality penalty. [PDF]
Huang X +4 more
europepmc +1 more source
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. [PDF]
Lehmann HP, Sanders P, Walzer S.
europepmc +1 more source

