Sciweavers

294 search results - page 25 / 59
» The complexity of computing a Nash equilibrium
Sort
View
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
14 years 11 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
14 years 4 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
ICRA
2006
IEEE
141views Robotics» more  ICRA 2006»
15 years 3 months ago
Computing 3-legged Equilibrium Stances in Three-dimensional Gravitational Environments
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....
Yizhar Or, Elon Rimon
PERCOM
2006
ACM
15 years 9 months ago
Context-Aware Resource Management in Multi-Inhabitant Smart Homes: A Nash H-Learning based Approach
A smart home aims at building intelligence automation with a goal to provide its inhabitants with maximum possible comfort, minimize the resource consumption and thus overall cost...
Nirmalya Roy, Abhishek Roy, Sajal K. Das
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 3 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra