Results 11 to 20 of about 5,399,796 (309)
Implementation of welfare maximizing networks [PDF]
We consider network formation. A set of locations can be connected in various network configurations. Every network has a cost and every agent has an individual value of every network.
Leth Hougaard, J., Tvede, M.
core +8 more sources
Maximal Quadratic-Free Sets [PDF]
Mathematical Programming, 2020 The intersection cut paradigm is a powerful framework that facilitates the generation of valid linear inequalities, or cutting planes, for a potentially complex set S. The key ingredients in this construction are a simplicial conic relaxation of S and an S-free set: a convex zone whose interior does not intersect S.
Gonzalo Muñoz 0001, Felipe Serrano 0001
openaire +4 more sources
Stability for Maximal Independent Sets [PDF]
The Electronic Journal of Combinatorics, 2020 Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large induced matching or triangle matching (depending on assumptions).
Jeff Kahn 0001, Jinyoung Park 0002
openaire +4 more sources
Maximal Equilateral Sets [PDF]
Discrete & Computational Geometry, 2013 A subset of a normed space $X$ is called equilateral if the distance between any two points is the same. Let $m(X)$ be the smallest possible size of an equilateral subset of $X$ maximal with respect to inclusion. We first observe that Petty's construction of a $d$-dimensional $X$ of any finite dimension $d\geq 4$ with $m(X)=4$ can be generalised to ...
Konrad J. Swanepoel, Rafael Villa
openaire +3 more sources
Beeping a maximal independent set [PDF]
Distributed Computing, 2011 arXiv admin note: substantial text overlap with arXiv:1108 ...
Yehuda Afek +5 more
openaire +6 more sources
Lower Bounds for Maximal Matchings and Maximal Independent Sets [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 There are distributed graph algorithms for finding maximal matchings and maximal independent sets in O ( Δ + log * n ) communication rounds; here, n is the number of nodes and Δ is the maximum degree.
Sebastian, Brandt +6 more
openaire +7 more sources
Bentham’s Binary Form of Maximizing Utilitarianism [PDF]
, 2017 Jeremy Bentham is often interpreted as defending a satisficing, rather than maximizing, version of utilitarianism, where an act is right as long as it produces more pleasure than pain.
Gustafsson, Carl Johan Eric +1 more
core +2 more sources
Welfare-maximizing tariff versus trade-surplus-maximizing tariff: Impacts on multinational firm competition [PDF]
, 2023 Designing appropriate import tariff rates is crucial for global trade. In this paper, we propose game-theoretic models to investigate how tariff policies affect the competition of multinational firms (MNFs) in a global trading environment.
Wang, Yulan +12 more
core +1 more source
Maximizing five-cycles in Kr-free graphs [PDF]
, 2021 The Pentagon Problem of Erd˝os problem asks to find an n-vertex triangle-free graph that is maximizing the number of 5-cycles. The problem was solved using flag algebras by Grzesik and independently by Hatami, Hladky´, Kr´al’, Norin, and Razborov ...
Murphy, Kyle, Lidicky, Bernard
core