Sciweavers

800 search results - page 43 / 160
» On the Complexity of Parity Games
Sort
View
SAGT
2010
Springer
119views Game Theory» more  SAGT 2010»
13 years 7 months ago
Minimal Subsidies in Expense Sharing Games
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschei...
FOCS
2007
IEEE
14 years 3 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ATAL
2007
Springer
14 years 3 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
DATE
2009
IEEE
170views Hardware» more  DATE 2009»
14 years 4 months ago
A novel LDPC decoder for DVB-S2 IP
Abstract—In this paper a programmable Forward Error Correction (FEC) IP for a DVB-S2 receiver is presented. It is composed of a Low-Density Parity Check (LDPC), a Bose-ChaudhuriH...
Stefan Müller 0004, Manuel Schreger, Marten K...
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 9 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...