SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Mechanism design in queueing problems
0 references·4 citing·10 second hop
Mechanism design in queueing problems (2001)Mechanism design in queueing problemsOn Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs (2007)On Scheduling Fees to Prevent…Proportional scheduling, split-proofness, and merge-proofness (2006)Proportional scheduling, spli…No-envy in queueing problems (2005)No-envy in queueing problemsA pessimistic approach to the queueing problem (2005)A pessimistic approach to the…17. A Value for n-Person Games (1953)Game theoretic analysis of a bankruptcy problem from the Talmud (1985)A value for n -person games (1988)Contributions to the theory of games. (1960)Cores of convex games (1971)Handbooks in operations research and management science (1989)Sybilproof reputation mechanisms (2005)Equal or proportional division of a surplus, and other methods (1987)Sequencing games (1989)Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue (1990)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2007On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs66 cited
  • 2005A pessimistic approach to the queueing problem64 cited
  • 2005No-envy in queueing problems62 cited
  • 2006Proportional scheduling, split-proofness, and merge-proofness36 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work