89 search results - page 18 / 18 » Admissibility in Infinite Games |
APAL
2010
13 years 5 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
SIGECOM
2008
ACM
13 years 5 months ago
2008
ACM
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
SIGECOM
2008
ACM
13 years 5 months ago
2008
ACM
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...