Sciweavers

5995 search results - page 344 / 1199
» Algorithmic Game Theory
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
SIGCOMM
2009
ACM
16 years 1 months ago
Matchmaking for online games and other latency-sensitive P2P systems
– The latency between machines on the Internet can dramatically affect users’ experience for many distributed applications. Particularly, in multiplayer online games, players s...
Sharad Agarwal, Jacob R. Lorch
ACMACE
2006
ACM
16 years 23 days ago
An empirical evaluation of TCP performance in online games
A fundamental design question to ask in the development of a network game is—Which transport protocol should be used—TCP, UDP, or some other protocols? Seeking an objective an...
Kuan-Ta Chen, Chun-Ying Huang, Polly Huang, Chin-L...
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
16 years 22 days ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
FPCA
1995
15 years 10 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong