Sciweavers

4435 search results - page 64 / 887
» Algorithms, games, and the internet
Sort
View
UAI
2001
13 years 11 months ago
Graphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....
ENTCS
2002
110views more  ENTCS 2002»
13 years 9 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
13 years 10 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
MANSCI
2006
119views more  MANSCI 2006»
13 years 10 months ago
Supply Chain Choice on the Internet
Internet companies extensively use the practice of drop-shipping, where the wholesaler stocks and owns the inventory and ships products directly to customers at retailers' re...
Serguei Netessine, Nils Rudi
INFOCOM
1998
IEEE
14 years 2 months ago
TCP Behavior of a Busy Internet Server: Analysis and Improvements
The rapid growth of the World Wide Web in recent years has caused a significant shift in the composition of Internet traffic. Although past work has studied the behavior of TCP dy...
Hari Balakrishnan, Venkata N. Padmanabhan, Sriniva...