Tree solutions and standardness for cycle-free graph games (Q2681825): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.econlet.2022.110955 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Rooted-tree solutions for tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average tree solution for cycle-free graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average tree value for hypergraph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Egalitarian allocation and players of certain type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Cooperation in Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component-wise proportional solutions for communication graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidding for surplus in network allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Null or nullifying players: the difference between the Shapley value and equal division solutions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ECONLET.2022.110955 / rank
 
Normal rank

Latest revision as of 17:42, 19 December 2024

scientific article
Language Label Description Also known as
English
Tree solutions and standardness for cycle-free graph games
scientific article

    Statements

    Identifiers