The even split rule for (concave) symmetric supermodular functions

DOI10.1016/J.ECONLET.2019.108783zbMATH Open1429.91181OpenAlexW2985522700MaRDI QIDQ2292771FDOQ2292771

Authors: Yanyan Li 

Publication date: 5 February 2020

Published in: Economics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.econlet.2019.108783

Recommendations

• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
• scientific article; zbMATH DE number 6297806
• scientific article; zbMATH DE number 4083365
• Covering symmetric supermodular functions by graphs
• Covering symmetric supermodular functions by uniform hypergraphs
• On concavity and supermodularity
• Decompositions of supermodular functions and \(\square\)-decomposable measures
• Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank
• Maximizing symmetric submodular functions
• Maximizing symmetric submodular functions

zbMATH Keywords

supermodular functionsPareto efficient allocationseven split rule

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
• Minimizing a Submodular Function on a Lattice
• Monotone Comparative Statics
• Nash equilibrium with strategic complementarities
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• The Comparative Statics of Constrained Optimization Problems
• Assortative Matching with Explicit Search Costs
• The even split rule in positive assortative matching

Cited In (2)

• Title not available (Why is that?)
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph

This page was built for publication: The even split rule for (concave) symmetric supermodular functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292771)