We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...

A group of rational individuals with common interest need to select one of two outcomes. The optimal decision depends on whether certain premises or pieces of evidence are established as being true, and each member receives a noisy signal of the truth value of the relevant premises. Should the...

We consider the dynamics of reasoning by general rules (theories) and by specific cases (analogies). When an agent faces an exogenous process, we show that, under mild conditions, if reality happens to be simple, the agent will converge to adopt a theory and discard analogical thinking. If,...

We study a dynamic coordination process in which agents are uncertain about the actions of their fellow agents, and anticipate strategically relevant information. Because of the uncertainty and learning, (ir)reversibility of actions has important strategic consequences. We find that the...

Economic models describe individuals by underlying characteristics, such as the degree to which they like music, have sympathy, want success, need recognition, etc. In reality, such characteristics change through experiences: taste for Mozart changes through attending concerts, sympathy through...

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to...

We consider a mechanism design problem in economies with increasing returns. We construct a new class of rules, called w-hybrid rules, and characterize them by strategy-proofness, anonymity, envy-freeness, consumer sovereignty, and non-bossiness. We show that w-hybrid rules improve the supremal...

We ask how to share the cost of finitely many public goods (items) among users with different needs: some smaller subsets of items are enough to serve the needs of each user, yet the cost of all items must be covered, even if this entails inefficiently paying for redundant items. Typical...

Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

We investigate an extension of the notion of backward induction to dynamic games with imperfect information and provide a doxastic characterization of it. Extensions of the idea of backward induction were proposed by Penta (2009) and later by Perea (2014), who also provided a doxastic...