Sciweavers

894 search results - page 84 / 179
» Game Theory with Costly Computation
Sort
View
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 2 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 1 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
ACSC
2006
IEEE
15 years 8 months ago
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
S. Cikara, Stanislaw P. Maj, David T. Shaw
NETCOOP
2007
Springer
15 years 8 months ago
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
Dominique Barth, Johanne Cohen, Loubna Echabbi, Ch...
FUIN
2010
97views more  FUIN 2010»
15 years 14 days ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant