Pages that link to "Item:Q934898"

The following pages link to The price of anarchy of serial, average and incremental cost sharing (Q934898):

Displaying 18 items.

• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• Implementing efficient graphs in connection networks (Q382330) (← links)
• Design of price mechanisms for network resource allocation via price of anarchy (Q662298) (← links)
• An efficient and almost budget balanced cost sharing method (Q993789) (← links)
• Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
• Is Shapley cost sharing optimal? (Q1651261) (← links)
• Cost sharing on prices for games on graphs (Q1680478) (← links)
• How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium (Q2140279) (← links)
• On cost sharing in the provision of a binary and excludable public good (Q2254034) (← links)
• Auctioning or assigning an object: some remarkable VCG mechanisms (Q2268363) (← links)
• Strong equilibria in games with the lexicographical improvement property (Q2376067) (← 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)
• Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
• Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
• Grid Integration of Renewable Electricity and Distributed Control (Q4625778) (← links)
• Cost Sharing in Production Economies (Q5150292) (← links)
• Bounds on the welfare loss from moral hazard with limited liability (Q5964694) (← links)