Sciweavers

2322 search results - page 147 / 465
» On a game in directed graphs
Sort
View
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 11 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
CIE
2007
Springer
15 years 7 months ago
Multimodal multiplayer tabletop gaming
There is a large disparity between the rich physical interfaces of co-located arcade games and the generic input devices seen in most home console systems. In this paper we argue ...
Edward Tse, Saul Greenberg, Chia Shen, Clifton For...
247
Voted
ATAL
2011
Springer
14 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
179
Voted
CORR
2007
Springer
122views Education» more  CORR 2007»
15 years 7 months ago
Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in Massively Multiplayer Online Games
A virtual plague is a process in which a behavior-affecting property spreads among characters in a Massively Multiplayer Online Game (MMOG). The MMOG individuals constitute a synt...
Magnus Boman, Stefan J. Johansson
271
Voted
WINE
2010
Springer
251views Economy» more  WINE 2010»
15 years 5 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis