Sciweavers

894 search results - page 37 / 179
» Game Theory with Costly Computation
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 3 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
ATAL
2009
Springer
15 years 8 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge
ATAL
2001
Springer
15 years 6 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 8 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 6 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...