Sciweavers

468 search results - page 58 / 94
» One-Way Functions in Complexity Theory
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 5 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
AMAI
2006
Springer
15 years 4 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 4 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
APIN
2002
80views more  APIN 2002»
15 years 4 months ago
Searching a Scalable Approach to Cerebellar Based Control
Decades of research into the structure and function of the cerebellum have led to a clear understanding of many of its cells, as well as how learning might take place. Furthermore...
Jan Peters, P. Patrick van der Smagt
BSL
2000
153views more  BSL 2000»
15 years 4 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon