Automatic Game Matching
- Topics:
- Video games
- Tags:
- Algorithm,
- Engineering,
- ETH Zurich,
- Games,
- Personal Technology
- Source:
- ETH Zurich
FREE Registration is required
Overview: This paper is about the developing and testing of online algorithms for automatic game matching in online games. The algorithms match the most suitable fellow players that arrive within a certain time period. This process is called as criteria based matching process whereas criteria might be for example the game level of a player or his geographical location. The paper shows that the algorithms achieve fairly average case matching compared to a fictitious optimal algorithm. The costs are about 40% above the optimum.
(Is this item miscategorized? Does it need more tags? Let us know.)
Format: PDF | Size: 184KB | Date: Mar 2003 | Pages: 13
People who downloaded this item also downloaded
![]() |
Computing Equilibrium Strategies in Infinite Games of Incomplete Information |



