108 search results - page 11 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
WINE
2005
Springer
15 years 5 months ago
2005
Springer
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...
115
Voted
MOBIHOC
2004
ACM
15 years 5 months ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
97
Voted
SAGT
2009
Springer
15 years 6 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
102
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
90
Voted
IOR
2008
14 years 11 months ago
2008
We consider a market with two suppliers and a set of buyers in search of procurement contracts with one of the suppliers. In particular, each buyer needs to process a certain volu...