Sciweavers

2681 search results - page 458 / 537
» Problem F
Sort
View
JACM
2007
160views more  JACM 2007»
13 years 10 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
PPDP
2010
Springer
13 years 8 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
13 years 27 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
STACS
2012
Springer
12 years 5 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
SIGECOM
2009
ACM
83views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
The price of truthfulness for pay-per-click auctions
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
Nikhil R. Devanur, Sham M. Kakade