Gruszczyńsk: Methods of constructing points from regions of space

Rafał Gruszczyńsk (Nicolaus Copernicus University, Toruń) will give an informal, non-colloquium talk this Friday, Nov. 21, at 2pm, in the seminar room (Philosophy 716). The title of the talk is “Methods of constructing points from regions of space”. Everybody is invited. The talk should be of special interest to colleagues and students working in logic, ontology, the philosophy of mathematics, and the philosophy of space and time.

Workshop on Pragmatics, Relevance and Game Theory

Workshop on Pragmatics, Relevance and Game Theory
CUNY Graduate Center, Rm. 9207
October 14 and 15, 2014

Preliminary list of speakers:
Deirdre Wilson (UCL)
Laurence Horn (Yale)
Kent Bach (SFSU)
Robyn Carston (UCL)
Ariel Rubinstein (NYU and Tel Aviv)

CUNY:
Michael Devitt
Stephen Neale
Rohit Parikh

Students:
Marilynn Johnson (CUNY)
Ignacio Ojea (Columbia)
Todd Stambaugh (CUNY)
Cagil Tasdemir (CUNY)

Program here.

Ramanujam: Reasoning in games that change during play

CUNY SEMINAR IN LOGIC, PROBABILITY, AND GAMES
Reasoning in games that change during play
R. Ramanujam (Institute of Mathematical Sciences, India)
4:00 – 6:00 PM, Friday, June 2, 2014
Room 4421, CUNY GC

Abstract. We consider large games, in which the number of players is so large that outcomes are determined not by strategy profiles, but by distributions. In the model we study, a society player monitors choice distributions and intervenes periodically, leading to game changes. Rationality of individual players and that of the society player are mutually interdependent in such games. We discuss stability issues, and mention applications to infrastructure problems.

Pacuit: Knowledge-Theoretic Aspects of Strategic Voting

CUNY SEMINAR IN LOGIC, PROBABILITY, AND GAMES
Knowledge-Theoretic Aspects of Strategic Voting
Eric Pacuit (University of Maryland)
4:15 – 6:15 PM, Friday, May 9, 2014
Room 3309, CUNY GC

Abstract. It has long been noted that a voter can sometimes achieve a preferred election outcome by misrepresenting his or her actual preferences. In fact, the classic Gibbard-Sattherthwaite Theorem shows that under very mild conditions, every voting method that is not a dictatorship is susceptible to manipulation by a single voter. One standard response to this important theorem is to note that a voter must possess information about the other voters’ preferences in order for the voter to decide to vote strategically. This seems to limit the “applicability” of the theorem. In this talk, I will survey some recent literature that aims at making this observation precise. This includes models of voting under uncertainty (about other voters’ preferences) and models that take into account how voters may response to poll information.

Ahmed: Causal Decision Theory and Intrapersonal Nash Equilibria

UNIVERSITY SEMINAR ON LOGIC, PROBABILITY, AND GAMES
Causal Decision Theory and Intrapersonal Nash Equilibria
Arif Ahmed (University of Cambridge)
4:15 PM, April 4th, 2014
716 Philosophy Hall, Columbia University

Abstract.  Most philosophers today prefer ‘Causal Decision Theory’ to Bayesian or other non-Causal Decision Theories. What explains this is the fact that in certain Newcomb-like cases, only Causal theories recommend an option on which you would have done better, whatever the state of the world had been. But if so, there are cases of sequential choice in which the same difficulty arises for Causal Decision Theory. Worse: under further light assumptions the Causal Theory faces a money pump in these cases. It may be illuminating to consider rational sequential choice as an intrapersonal game between one’s stages, and if time permits I will do this. In that light the difficulty for Causal Decision Theory appears to be that it allows, but its non-causal rivals do not allow, for Nash equilibria in such games that are Pareto inefficient.