Results 71 to 80 of about 916,150 (184)
Covering a cubic graph with perfect matchings
, 2013 Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them.
Mazzuoccolo, Giuseppe
core +2 more sources
Selection in car insurance when claims are heterogeneous
Journal of Risk and Insurance, EarlyView.Abstract Econometric studies of insurance markets have analyzed the Positive Correlation Property to test for the presence of asymmetric information. Car‐insurance studies frequently compare policies purchasing Mandatory Third‐Party Liability alone with policies that purchase additional coverage and use the presence of a liability claim as a measure of
Edmund Cannon +2 more
wiley +1 more source
The Simple Geometry of Perfect Information Games [PDF]
Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there
Demichelis, Stefano +2 more
core
Moral hazard induced unraveling: Theory and evidence from the Affordable Care Act
Journal of Risk and Insurance, EarlyView.Abstract We identify and quantify a new form of welfare loss in insurance markets. We first show theoretically that moral hazard from subsidies for cost‐sharing combined with community rating mimics adverse selection and can unravel insurance markets.
Cameron M. Ellis +2 more
wiley +1 more source
Fairness‐aware insurance pricing: A multi‐objective optimization approach
Journal of Risk and Insurance, EarlyView.Abstract Machine‐learning models can provide accurate predictions in insurance pricing, but can also increase disparities between protected groups. Existing fairness‐aware pricing approaches typically target one fairness notion at a time, making it difficult to compare trade‐offs between predictive accuracy, group fairness, individual fairness, and ...
Tim J. Boonen, Xinyue Fan, Zixiao Quan
wiley +1 more source
Decomposing Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no old hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
The fundamental theorem of asset pricing with and without transaction costs
Mathematical Finance, Volume 35, Issue 2, Page 567-609, April 2025.Abstract We prove a version of the fundamental theorem of asset pricing (FTAP) in continuous time that is based on the strict no‐arbitrage condition and that is applicable to both frictionless markets and markets with proportional transaction costs. We consider a market with a single risky asset whose ask price process is higher than or equal to its ...
Christoph Kühn
wiley +1 more source
Resonance Graph of Perfect Matchings [PDF]
, 2019 Let G be a graph with perfect matchings and let C be a set of linearly independent even cycles of G of width at most 2. The resonance graph R(G, C) is a graph with the vertex set M a subset of M(G) such that two vertices Mi and Mj are adjacent if and ...
Aluoch, James
core
Why Are All the Sets All the Sets?
Noûs, EarlyView.ABSTRACT Necessitists about set theory think that the pure sets exists, and are the way they are, as a matter of necessity. They cannot explain why the sets (de rebus) are all the sets. This constitutes the Ur‐Objection against necessitism; it is the primary motivation cited by potentialists about set theory.
Tim Button
wiley +1 more source
Parameterized Graph Modification Algorithms [PDF]
, 2015 Graph modification problems form an important class of algorithmic problems in computer science. In this thesis, we study edge modification problems towards classes related to chordal graphs, with the main focus on trivially perfect graphs and threshold ...
Drange, Pål Grønås
core