Sciweavers

1087 search results - page 44 / 218
» Dynamics in congestion games
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
DEXAW
2002
IEEE
102views Database» more  DEXAW 2002»
14 years 1 months ago
Indexing Mobile Objects on the Plane
We present a method to index objects moving on the plane in order to efficiently answer range queries about their position in the future. This problem is motivated by real-life a...
Dimitris Papadopoulos, George Kollios, Dimitrios G...
ECAL
1999
Springer
14 years 29 days ago
Dynamical Systems Game
The “social dilemma” is a problem inherent in forming and maintaining cooperation among selfish individuals, and is of fundamental importance in the biological and social sci...
Eizo Akiyama, Kunihiko Kaneko
ATAL
2009
Springer
14 years 3 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
GLOBECOM
2009
IEEE
14 years 3 months ago
Price War with Partial Spectrum Sharing for Competitive Wireless Service Providers
—In 3G wireless technologies, competitive operators are assigned a fixed part of the spectrum from long-term auctions. This is known to lead to utilization inefficiencies becau...
Patrick Maillé, Bruno Tuffin