Pages that link to "Item:Q2460223"
From MaRDI portal
The following pages link to The worst absolute surplus loss in the problem of commons: random priority versus average cost (Q2460223):
Displaying 15 items.
- A general impossibility theorem and its application to individual rights (Q277315) (← links)
- Implementing efficient graphs in connection networks (Q382330) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
- Sharing sequential values in a network (Q1622386) (← links)
- Free intermediation in resource transmission (Q1792561) (← links)
- Optimal budget-balanced ranking mechanisms to assign identical objects (Q2205993) (← links)
- Profit-sharing and efficient time allocation (Q2206008) (← links)
- Egalitarian equivalence and strategyproofness in the queueing problem (Q2249580) (← links)
- On cost sharing in the provision of a binary and excludable public good (Q2254034) (← links)
- Strategy-proof cost sharing under increasing returns: improvement of the supremal welfare loss (Q2345238) (← links)
- Wary of the worst: maximizing award guarantees when new claimants may arrive (Q2411533) (← links)
- Group strategyproof cost sharing: the role of indifferences (Q2437817) (← links)
- Strategy-proof rules for an excludable public good (Q2629521) (← links)
