<?xml version="1.0" standalone="no"?>
                    <!DOCTYPE div SYSTEM "/www/backend/www-xml-443/dtd/caidaML.dtd">
                    <!-- do NOT ERASE the DOCTYPE declaration! --><div>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>URL:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
<a href="http://portal.acm.org/citation.cfm?id=1278940.1278948&amp;coll=ACM&amp;dl=GUIDE&amp;type=series&amp;idx=SERIES101&amp;part=series&amp;WantType=Proceedings&amp;title=NSPW">http://portal.acm.org/citation.cfm?id=1278940.1278948&amp;coll=ACM&amp;dl=GUIDE&amp;type=series&amp;idx=SERIES101&amp;part=series&amp;WantType=Proceedings&amp;title=NSPW</a>
</font>
  </td>
</tr>


<tr bgcolor="#e9e9e9">
  <td>
<font face="helvetica,arial" size="2">
<b>Entry Date:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
2008-06-09


</font>
  </td>
</tr>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>Abstract:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
This work explores issues of computational disclosure control. We
examine assumptions in the foundations of traditional problem statements
and abstract models. We offer a comprehensive framework, based on the
notion of an inference game, that unifies various inference problems by
parameterizing their problem spaces. This work raises questions
regarding the significance of intractability results. We analyze common
structural aspects of inference problems via case studies; these
emphasize why explicit policies are needed to specify all social context
and ethical values relevant to a problem instance.
 




</font>
  </td>
</tr>
</div>

