Results 71 to 80 of about 1,222,002 (199)
Normal hypergraphs and the perfect graph conjecture [PDF]
, 1972 A hypergraph is called normal if the chromatic index of any partial hypergraph H′ of it coincides with the maximum valency in H′. It is proved that a hypergraph is normal iff the maximum number of disjoint hyperedges coincides with the minimum number of ...
Lovász, L.
core +1 more source
Strictly Conservative Neural Distance Fields
Computer Graphics Forum, EarlyView.Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley +1 more source
Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Second Version [PDF]
A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal.
George J. Mailath, : Wojciech Olszewski
core
Economica, EarlyView.Abstract I argue that economists' distinction between ‘pure’ and ‘applied’ economic theory is often based on papers' stylistic markers rather than their methodology or scope. I illustrate this point with a model of price competition for boundedly rational consumers, due to Piccione and Spiegler. I first present its original, ‘pure style’ version.
Ran Spiegler
wiley +1 more source
A Horse Race of Machine‐Learning Methods to Predict Banking Crises
International Finance, EarlyView.ABSTRACT To examine if one machine‐learning model can consistently elucidate financial vulnerabilities, both over time and across levels of development, this paper applies 13 machine‐learning algorithms to evaluate comparative forecasting performance across several banking crises.
Emile du Plessis
wiley +1 more source
On the Existence of Markov Perfect Equilibria in Perfect Information Games [PDF]
We study the existence of pure strategy Markov perfect equilibria in two-person perfect information games. There is a state space X and each period player's possible actions are a subset of X.
Hannu Vartiainen, Hannu Salonen
core
The application of machine learning models to optimal TSP tour length estimation
International Transactions in Operational Research, EarlyView.Abstract The traveling salesman problem (TSP) is a well‐known NP‐hard problem in combinatorial optimization, with numerous applications in logistics and elsewhere. This paper introduces a machine learning‐based approach to estimate the optimal tour length of the TSP, using linear regression, random forests (RF), and neural networks, including ...
Shuhan Kou, Bruce Golden, Luca Bertazzi
wiley +1 more source
Bargaining Foundations of the Median Voter Theorem [PDF]
We provide game-theoretic foundations for the median voter theorem in a one-dimensional bargaining model based on Baron and Ferejohn’s (1989) model of distributive politics.
John Duggan, Seok-ju Cho
core
Capital‐Labour Substitution in Macroeconomics: A Survey of Mechanisms, Dynamics and Policy Insights
Journal of Economic Surveys, EarlyView.ABSTRACT Macroeconomic conclusions often hinge on a single, hard‐to‐pin‐down parameter: the elasticity of substitution between capital and labour, σ. This survey synthesises theory and evidence on how results change once we move beyond the Cobb–Douglas benchmark (σ=1$\sigma = 1$).
Francisco Rebelo, Fernando Del Río
wiley +1 more source
Feedback and Contagion through Distressed Competition
The Journal of Finance, EarlyView.ABSTRACT Firms tend to compete more aggressively when facing financial distress. This intensified competition reduces profit margins, pushing them further into distress and adversely affecting their industry peers. To study such feedback and contagion effects, we incorporate strategic competition in a dynamic model with long‐term defaultable debt ...
HUI CHEN +3 more
wiley +1 more source