The following pages link to STACS 2005 (Q5710676):
Displaying 12 items.
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Mechanism design for set cover games with selfish element agents (Q1041237) (← links)
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game (Q3532565) (← links)
- Competitive Cost Sharing with Economies of Scale (Q5458541) (← links)
- Algorithmic Applications in Management (Q5710136) (← links)
- Algorithms and Computation (Q5712113) (← links)