Pages that link to "Item:Q705856"
From MaRDI portal
The following pages link to Simple sequencing problems with interdependent costs (Q705856):
Displayed 13 items.
- A rescheduling and cost allocation mechanism for delayed arrivals (Q342157) (← links)
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency (Q427528) (← links)
- When queueing is better than push and shove (Q532746) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Relative priority policies for minimizing the cost of queueing systems with service discrimination (Q965531) (← links)
- Second-best mechanisms in queuing problems without transfers: the role of random priorities (Q1680100) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines (Q1939524) (← links)
- On optimal mechanism design for a sequencing problem (Q2018936) (← links)
- Balanced implementability of sequencing rules (Q2278931) (← links)
- Incentives and justice for sequencing problems (Q2403448) (← links)
- Recent developments in the queueing problem (Q2421321) (← links)
- Balanced VCG mechanisms for sequencing problems (Q6168820) (← links)