Pages that link to "Item:Q382330"
From MaRDI portal
The following pages link to Implementing efficient graphs in connection networks (Q382330):
Displayed 14 items.
- Incentive-compatible simple mechanisms (Q825192) (← links)
- Minimum cost connection networks: truth-telling and implementation (Q894009) (← links)
- Sharing sequential values in a network (Q1622386) (← links)
- Proportional rules for state contingent claims (Q1742148) (← links)
- Free intermediation in resource transmission (Q1792561) (← links)
- Coalitional efficient profit-sharing (Q2036964) (← links)
- Cost-allocation problems for fuzzy agents in a fixed-tree network (Q2096663) (← links)
- Fairness and efficiency in cake-cutting with single-peaked preferences (Q2180735) (← links)
- Routing-proofness in congestion-prone networks (Q2183993) (← links)
- Profit-sharing and efficient time allocation (Q2206008) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- A monotonic and merge-proof rule in minimum cost spanning tree situations (Q2358794) (← links)
- Rationing Rules Under Uncertain Claims: A Survey (Q5022158) (← links)
- An egalitarian solution to minimum cost spanning tree problems (Q6146788) (← links)