Sciweavers

Share
WINE
2005
Springer
146views Economy» more  WINE 2005»
9 years 9 months ago
A Cost Mechanism for Fair Pricing of Resource Usage
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
Marios Mavronicolas, Panagiota N. Panagopoulou, Pa...
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
9 years 9 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
INFOCOM
2005
IEEE
9 years 9 months ago
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput
— We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations th...
Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang
INFOCOM
2005
IEEE
9 years 9 months ago
A cost-based analysis of overlay routing geometries
— In this paper, we propose a cost-based model to evaluate the resources that each node has to contribute for participating in an overlay network. Such a cost model allows to gau...
Nicolas Christin, John Chuang
SPAA
2006
ACM
9 years 9 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
9 years 9 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
WIOPT
2006
IEEE
9 years 9 months ago
Reverse engineering MAC
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Ao Tang, Jang-Won Lee, Jianwei Huang, Mung Chiang,...
INFOCOM
2006
IEEE
9 years 9 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda
FOCS
2006
IEEE
9 years 9 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
TARK
2007
Springer
9 years 9 months ago
Generalized solution concepts in games with possibly unaware players
Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work [Halpern and Rˆego 2006], w...
Leandro Chaves Rêgo, Joseph Y. Halpern
books