894 search results - page 61 / 179 » Game Theory with Costly Computation |
132
click to vote
JSAC
2008
15 years 1 months ago
2008
If a network is to operate successfully, its users need to collaborate. Collaboration takes the form of following a network protocol and involves some resource expenditure on the p...
103
click to vote
JUCS
2007
15 years 1 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
133
click to vote
CIE
2010
Springer
15 years 6 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
143
Voted
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Recently, some mainstream e-commerce web sites have begun using “pay-per-bid” auctions to sell items, from video games to bars of gold. In these auctions, bidders incur a cost...