Pages that link to "Item:Q548071"
From MaRDI portal
The following pages link to Merge-proofness in minimum cost spanning tree problems (Q548071):
Displaying 10 items.
- Pairwise mergers in bipartite matching games with an application in collaborative logistics (Q1709976) (← links)
- Reaching the bound in the \((2,n)\) merging problem (Q1818797) (← links)
- Truth-telling and Nash equilibria in minimum cost spanning tree models (Q1926969) (← links)
- Reassignment-proof rules for land rental problems (Q2178644) (← links)
- A monotonic and merge-proof rule in minimum cost spanning tree situations (Q2358794) (← links)
- Minimum cost spanning tree problems with indifferent agents (Q2442831) (← links)
- Cooperative approach to a location problem with agglomeration economies (Q2689415) (← links)
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems (Q2854002) (← links)
- Notes on the Distributed Computation of Merge Trees on CW-Complexes (Q5359524) (← links)
- Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)