Sciweavers

16 search results - page 1 / 4
» Program equilibria and discounted computation time
Sort
View
TARK
2009
Springer
14 years 2 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
CG
2006
Springer
13 years 11 months ago
Computing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
Peter Bro Miltersen, Troels Bjerre Sørensen
AAAI
2010
13 years 9 months ago
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
Andriy Burkov, Brahim Chaib-draa
TCS
2010
13 years 5 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
EOR
2007
93views more  EOR 2007»
13 years 7 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...