Pages that link to "Item:Q3452219"
From MaRDI portal
The following pages link to Quantifying inefficiency in cost-sharing mechanisms (Q3452219):
Displaying 22 items.
- Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- Is Shapley cost sharing optimal? (Q1651261) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Efficiency and budget balance in general quasi-linear domains (Q1735779) (← links)
- Cost sharing under increasing returns: A comparison of simple mechanisms (Q1919679) (← links)
- Cost-sharing mechanism for excludable goods with generalized non-rivalry (Q2025030) (← links)
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium (Q2140279) (← links)
- Inefficiencies on linking decisions (Q2268896) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Cost sharing in two-sided markets (Q2670930) (← links)
- Collusion-proof mechanisms for multi-unit procurement (Q2685840) (← links)
- Limitations of cross-monotonic cost sharing schemes (Q2921718) (← links)
- Efficiency and Budget Balance (Q2959843) (← links)
- Computing Stable Coalitions: Approximation Algorithms for Reward Sharing (Q3460775) (← links)
- Limitations of cross-monotonic cost-sharing schemes (Q4962717) (← links)
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond (Q5075756) (← links)
- Quantifying the Burden of Exploration and the Unfairness of Free Riding (Q5146901) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- (Q5743446) (← links)
