Classic direct mechanisms require full utility revelation from agents, which can be very difficult in practical multi-attribute settings. In this work, we study partial revelation within the framework of one-shot mechanisms. Each agent’s type space is partitioned into a finite set of partial types and agents (should) report the partial type within which their full type lies. A classic result im...

To bridge the gap between the dissimilar mechanisms and entities of the phonological grammar and those of the phonetic mechanisms for producing and perceiving speech, the ‘phonetics-phonology interface’ (PPI) has been invoked. In this brief presentation, an introduction to the ICPhS 2003 Symposium on The Phonetics-Phonology Interface, I present an exegesis and taxonomy of the PPI and some citat...

In this paper, we utilize the Several interference revelation techniques proposed for mobile ad hoc networks rely on each node passively monitoring the data forwarding by its next hop. This paper presents quantitative evaluations of false positives and their impact on monitoring based interference revelation for ad hoc networks. Experimental results show that, even for a simple three-node confi...

We study decidability of a logic for describing processes with restricted names. We choose a minimal fragment of the Ambient Logic, but the techniques we present should apply to every logic which uses Cardelli and Gordon revelation and hiding operators, and Gabbay and Pitts freshness quantifier. We start from the static fragment of ambient logic that Calcagno, Cardelli and Gordon proved to be d...

Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and ...

We propose a formal approach to the problem of transforming uncertainty into risk via information revelation processes. Abstractions and formalizations regarding information acquisition processes are common in different areas of information sciences. We investigate the relationships between the way information is acquired and the continuity properties of revelation processes. A class of revelat...

The revelation effect describes the increased tendency to call items old when a recognition judgment is preceded by an incidental task. In theory, the effect could come about either from a more liberal response bias or from a change in underlying memory sensitivity. Using analyses of receiver-operating characteristic curves, we show that the revelation effect occurs for each of these reasons, b...

I examine two types of mechanisms, demand revelation mechanisms and preference revelation mechanisms, in many-to-one matching problems. As in Hatfield and Milgrom (2005), I consider general matching problems with contracts. I show that the core correspondence is not Nash-implementable by any demand/preference revelation mechanism. A strong version of Maskin monotonicity plays a crucial role for...

Privacy Concerns, Voluntary Disclosure of Information, and Unraveling: An Experiment by Volker Benndorf, Dorothea Kübler and Hans-Theo Normann* We study the voluntary revelation of private, personal information in a labor-market experiment with a lemons structure where workers can reveal their productivity at a cost. While rational revelation improves a worker's payout, it imposes a negative ex...

If it can be ascertained experimentally that the 3 × 3 Majorana neutrino mass matrix Mν has vanishing determinants for one or more of its 2 × 2 submatrices, the theoretically well-known canonical seesaw mechanism may be revealed as its progenitor. I show how these two things are connected and offer a realistic Mν with two zero subdeterminants as an example. It is a common theoretical belief in ...