Arunava Sen

Last updated

Arunava Sen
Arunava Sen.jpg
Sen delivering a lecture at the Seoul meeting of the Society for Social Choice and Welfare
Born (1959-01-03) 3 January 1959 (age 65)
Bombay
Nationality Indian
Academic career
Institution Indian Statistical Institute
Field Game Theory, Social Choice Theory, Mechanism Design, Auctions
Alma mater University of Delhi (B.A., M.A.)
Oxford University (M.Phil.)
Princeton University (Ph.D.)
Doctoral
advisor		 Hugo F. Sonnenschein
Website https://www.isid.ac.in/~asen/index.html

Arunava Sen (born 3 January 1959) is a professor of economics at the Indian Statistical Institute. [1] He works on Game Theory, Social Choice Theory, Mechanism Design, Voting and Auctions. [1]

Contents

Early life

Arunava Sen was born in Bombay (currently, Mumbai) on 3 January 1959. [2] Soon after he was born, his parents moved to Delhi, where he attended the St. Columba's School. In 1970, the family moved to the Chittaranjan Park neighbourhood in South Delhi, where he still lives. [2]

Education

Arunava Sen received a B.A. degree in economics from St. Stephen's College, New Delhi, in 1978, and an M.A. degree in economics from Delhi School of Economics in 1980. [1] He then went to Oxford University on an Inlaks scholarship where he received an M.Phil. in 1982. [1] He was tutored and advised by Sir James Mirlees at Oxford University. Then, he joined the Princeton University for his Ph.D. and worked on the theory of implementation under the supervision of Hugo Sonnenschein. [3] He received his Ph.D. in 1987. [1] Besides his advisor Hugo Sonnenschein, other members in his Ph.D. dissertation committee included Andrew Caplin and Joseph Stiglitz.

Career and research contributions

Arunava Sen joined the Delhi center of Indian Statistical Institute immediately after his Ph.D. in 1987 and has been with the Institute since then. He is currently a professor at the Economics and Planning Unit of the Institute. [1] He is most well known for his contribution to the implementation theory and mechanism design. These subfields of game theory is concerned with the design of mechanisms or institutions that produce socially desirable outcomes in equilibrium. The 2007 Nobel prize in Economics was awarded to Leonid Hurwicz, Eric Maskin, and Roger Myerson for their contribution to the theory of mechanism design and implementation theory. The scientific background document of the Nobel prize [4] cites Arunava Sen's work with his coauthor Dilip Abreu.

Implementation theory

The implementation theory is widely regarded as the reverse engineering of game theory. [4] It is concerned with the design of a game (or game-form) such that every equilibrium outcome of the game produces the desired outcome (modeled as a social choice rule) of the designer. The notion of equilibrium or the solution concept allows flexibility in designing games. In his Nobel prize winning work, Eric Maskin investigates implementation using Nash equilibrium as the solution concept. [5] Maskin shows that any Nash implementable social choice rule must satisfy a monotonicity property, which is now called Maskin monotonicity. Conversely, every social choice rule which is Maskin monotone and satisfies a mild property, called no veto power, can be implemented in Nash equilibrium. [5] This started a large literature in implementation theory. Arunava Sen, along with his coauthors, has contributed to this literature by extending Maskin's results in various directions.

Maskin's result [5] requires that there are at least three agents who will play the designed game. In his work [6] with Bhaskar Dutta, Arunava Sen extends Maskin's result when there are only two agents. In his work [7] with Dilip Abreu, they introduce a new implementation framework. In their model, a social choice rule produces a lottery over a finite set of outcomes at every profile of preferences. The equilibrium outcome lottery of the designed game need not coincide with the social choice rule outcome, but they have to be arbitrarily close. They call this virtual implementation [7] and show that virtual implementation using Nash equilibrium as the solution concept is quite permissive. In another joint work [8] with Dilip Abreu, Arunava Sen investigates implementation where a designer can design extensive form games. They describe the social choice rules that can be implemented in subgame perfect equilibrium. Their result extends the work of Moore and Repullo. [9]

In his work [10] with Bhaskar Dutta, Arunava Sen studies a new model of implementation, where agents (playing the game) can be partially honest. In their model, an agent is partially honest if she strictly prefers telling the truth whenever she is indifferent between telling the truth and lying. This paper revisits Maskin's seminal paper [5] in this new model and presents several new insights. They show that if there is at least one partially honest agent (out of at least three agents), then every social choice rule satisfying no veto power can be implemented in Nash equilibrium. Thus, Maskin monotonicity is no longer a necessary condition in this model.

In his work [11] with Saptarshi Mukherjee (one of his Ph.D. students), Nozumo Muto, and Eve Raemakers, Arunava Sen studies implementation in undominated strategies using bounded mechanisms. They show that the Pareto correspondence is implementable in undominated strategies using bounded mechanisms. [11] This answers an open question in the literature posed by Tilman Börgers. [12] The work is also important because implementation in undominated strategies has been criticised for using unbounded mechanisms to establish various results, [13] and their work provides a general positive result on implementation using bounded mechanisms and undominated strategies.

Strategic voting theory

Arunava Sen has done fundamental contributions to the theory of strategic voting. The starting point of this theory is an impossibility result due to Gibbard and Satterthwaite: the Gibbard-Satterthwaite (GS) impossibility theorem and Gibbard's theorem. Roughly, it states that there is no voting rule which is unanimous, non-dictatorial, and non-manipulable (strategyproof) if the preferences of voters are unrestricted. Arunava Sen's work in this area identifies environments where such theorems hold or well-behaved voting rules exist. In his work [14] with his coauthors Navin Aswal and Shurojit Chatterji, he provides a comprehensive description of environments where GS theorem holds. In his works [15] and [16] with coauthors Shurojit Chatterji, Huaxia Zeng, and Remzi Sanver, he identifies environments where GS theorem does not hold, i.e., well-behaved voting rules exist. In his work [17] with coauthors Shurojit Chatterji and Huaxia Zeng, he has identified environments where the GS theorem type result continues to hold even if the voting rule allows for randomization (which generalizes Gibbard's theorem).

In his work [18] with his coauthor (and Ph.D. student) Dipjyoti Majumdar, he weakens the notion of non-manipulability in the GS theorem to Ordinal Bayesian Incentive Compatibility, first studied in an important paper by Claude d'Aspremont and Gerard Varet. [19] Arunava's work [18] with Dipjyoti Majumdar shows that whether well-behaved voting rules exist with this weakening of non-manipulability depends on the beliefs of the voters on other voters' preferences. If beliefs are uniformly distributed, then many well-behaved voting rules exist and they provide a comprehensive description of such voting rules. However, if voters have generic beliefs (which are independent), a GS theorem type impossibility reappears. In a follow up work [20] with Mohit Bhargava and Dipjyoti Majumdar, he shows that if voters beliefs are correlated, then it is possible to escape the impossibility of the GS theorem using this weaker notion of incentive compatibility.

In his work [21] with his coauthor Michel Le Breton, he studies a voting environment where voters vote on various dimensions but preferences of voters are separable across dimensions. Their work identifies conditions on environments such that every unanimous and non-manipulable (strategyproof) voting rule can be decomposed along each dimension. He has pursued this line of research in some of his other work. [22] In his work [23] with Bhaskar Dutta and Hans Peters, he shows that considering cardinal voting schemes does not allow one to escape the consequences of GS impossibility theorem.

Mechanism design with transfers

Arunava Sen has done fundamental contributions to the theory of mechanism design where transfers are used for incentives, e.g., auction design. In mechanism design, incentive compatibility is often characterized by (equivalent to) some form of monotonicity condition. In his seminal work on revenue-maximizing single object auctions, Roger Myerson provides such a monotonicity condition. In his work [24] with Sushil Bikhchandani, Shurojit Chatterji, Ron Lavi, Ahuva Mualem, and Noam Nisan, Arunava Sen provides an analogue of this monotonicity condition which works in a variety of problems, including multi-object auctions and provision of multiple public goods. This work [24] is regarded as a fundamental contribution to the multidimensional mechanism design literature, where private information of agents have multiple dimensions. In his works [25] and [26] with Debasis Mishra and Swaprava Nath, he has described the set of all strategyproof mechanisms in mechanism design settings which permit transfers. These contributions extend a seminal characterization of strategyproof mechanisms in these settings due to Kevin W. S. Roberts.

Simpler proofs of important theorems in mechanism design

Arunava Sen has provided simple proofs of three important theorems in mechanism design. In his work, [27] he uses induction on the number of agents to provide a simple proof of the Gibbard-Satterthwaite (GS) theorem. The induction technique in proving the GS theorem is quite easily extendible to other settings where such theorems hold. For instance, in his work [18] with Dipjyoti Majumdar, he uses similar induction techniques to prove an analogue of the GS theorem using a weaker notion of incentive compatibility. He uses the induction technique to prove a simpler version of Gibbard's theorem in his work. [28] In his work [25] with Debasis Mishra, he provides a simpler proof of an important theorem, due to Kevin W. S. Roberts, which characterizes the set of strategyproof mechanisms in mechanism design problems with transfers. This proof uses ideas from social choice theory, particularly in. [19]

In general, Arunava Sen's works tend to connect different branches of mechanism design theory and social choice theory to establish elegant results in different areas of economic theory. A prime example of such a work is [29] with Mridu Prabal Goswami. In this work, [29] they use ideas from Myerson's single object auction design to prove a dictatorship result in an exchange economy setting, a problem which was first studied by Leonid Hurwicz.

His contributions have been published in journals like Econometrica, Review of Economic Studies, Theoretical Economics, Journal of Economic Theory, Games and Economic Behavior and Social Choice and Welfare among others. [1]

Student supervision and teaching

Arunava Sen enjoys supervising Ph.D. and Masters students. He is known for being extremely generous with his time when it comes to mentoring students. Till 2015, he had advised nine Ph.D. students at Indian Statistical Institute, and all of them hold academic positions in various universities and institutes. He also routinely advises Masters and senior undergraduate students in their thesis work.

Arunava Sen is a popular teacher at Indian Statistical Institute. He has taught various courses on economic theory, including Game Theory, Social Choice Theory, Microeconomics. He is famous for never bringing a single line of note or paper to his classes and teaching on blackboard with impeccable accuracy without any immediate reference.

Awards and honors

Arunava Sen is President Elect of the Society for Social Choice and Welfare, Fellow of the Econometric Society and an Economic Theory Fellow. [1] He has been awarded the Mahalanobis Memorial Medal of the Indian Econometric Society for his contribution to Economics. [1] He is a recipient of the 2012 Infosys Prize in the Social Sciences category [30] for his work on "game-theoretic analyses of mechanism design for implementing social choice rules, when individuals have diverse information and incentives". [31] In 2017, he received the TWAS-Siwei Cheng Prize for his " theoretical work on the collective, strategic behavior of people trying to get what they want from rule-based institutions". [32] He also served on the Social Sciences jury for the Infosys Prize in 2014 and 2016.

Personal life

Arunava Sen's mother Nihar Sen was a housewife and father Jyotirmoy Sen worked in civil aviation as an air crash investigator. He is the youngest of three children in the family.

Arunava Sen is married to Kavita Singh since 2000. Kavita Singh is a distinguished art historian and a Professor of Art History at Jawaharlal Nehru University in Delhi. Their son Aditya Sen was born in 2003. When Kavita Singh won the Infosys Prize in 2018, [33] they became the second Indian couple to win the Infosys Prize in different fields.

Other interests

Arunava Sen is an avid fan of Chess. His favorite chess player is Vishwanathan Anand. He likes solving online chess problems daily.

Selected publications

A selection of articles authored by Arunava Sen based on Google Scholar citations are given below.

[2]

Related Research Articles

<span class="mw-page-title-main">Kenneth Arrow</span> American economist (1921–2017)

Kenneth Joseph Arrow was an American economist, mathematician, writer, and political theorist. Along with John Hicks, he won the Nobel Memorial Prize in Economic Sciences in 1972.

Arrow's impossibility theorem is a key result in social choice showing that no ranked-choice voting rule can produce a rational result when there are more than two candidates. Specifically, any such rule violates independence of irrelevant alternatives: the principle that a choice between and should not depend on a third, unrelated option .

The Gibbard–Satterthwaite theorem is a theorem in voting theory. It was first conjectured by the philosopher Michael Dummett and the mathematician Robin Farquharson in 1961 and then proved independently by the philosopher Allan Gibbard in 1973 and economist Mark Satterthwaite in 1975. It deals with deterministic ordinal electoral systems that choose a single winner, and states that for every voting rule of this form, at least one of the following three things must hold:

  1. The rule is dictatorial, i.e. there exists a distinguished voter who can choose the winner; or
  2. The rule limits the possible outcomes to two alternatives only; or
  3. The rule is susceptible to tactical voting: in some situations, a voter's sincere ballot may not best defend their opinion.
<span class="mw-page-title-main">Gérard Debreu</span> French economist and mathematician

Gérard Debreu was a French-born economist and mathematician. Best known as a professor of economics at the University of California, Berkeley, where he began work in 1962, he won the 1983 Nobel Memorial Prize in Economic Sciences.

<span class="mw-page-title-main">Mechanism design</span> Field of economics and game theory

Mechanism design is a branch of economics, social choice theory, and game theory that deals with designing games to implement a given social choice function. Because it starts at the end of the game and then works backwards to find a game that implements it, it is sometimes called reverse game theory.

<span class="mw-page-title-main">Paul Milgrom</span> Economist and winner of the 2020 Nobel Prize in Economics

Paul Robert Milgrom is an American economist. He is the Shirley and Leonard Ely Professor of Humanities and Sciences at the Stanford University School of Humanities and Sciences, a position he has held since 1987. He is a professor in the Stanford School of Engineering as well and a Senior Fellow at the Stanford Institute for Economic Research. Milgrom is an expert in game theory, specifically auction theory and pricing strategies. He is the winner of the 2020 Nobel Memorial Prize in Economic Sciences, together with Robert B. Wilson, "for improvements to auction theory and inventions of new auction formats".

Social choice theory or social choice is a branch of welfare economics that analyzes mechanisms and procedures for collective decision-making. Social choice incorporates insights from economics, mathematics, and game theory to find the best ways to combine individual opinions, preferences, or beliefs into a single coherent measure of the quality of different outcomes, called a social welfare function.

Allan Fletcher Gibbard is the Richard B. Brandt Distinguished University Professor of Philosophy Emeritus at the University of Michigan, Ann Arbor. Gibbard has made major contributions to contemporary ethical theory, in particular metaethics, where he has developed a contemporary version of non-cognitivism. He has also published articles in the philosophy of language, metaphysics, and social choice theory: in social choice, he first proved the result known today as Gibbard-Satterthwaite theorem, which had been previously conjectured by Michael Dummett and Robin Farquharson.

A mechanism is called incentive-compatible (IC) or truthful if every participant can achieve their own best outcome by acting according to their true preferences. For example, there is incentive compatibility if high-risk clients are better off in identifying themselves as high-risk to insurance firms, who only sell discounted insurance to high-risk clients. Likewise, they would be worse off if they pretend to be low-risk. Low-risk clients who pretend to be high-risk would also be worse off.

The revelation principle is a fundamental result in mechanism design, social choice theory, and game theory which shows it is always possible to design a strategy-resistant implementation of a social decision-making mechanism. It can be seen as a kind of mirror image to Gibbard's theorem. The revelation principle says that if a social choice function can be implemented using some non-truthful mechanism, the same function can be implemented by a truthful mechanism which has the same equilibrium outcome (payoffs).

<span class="mw-page-title-main">Eric Maskin</span> American Nobel laureate in economics

Eric Stark Maskin is an American economist and mathematician. He was jointly awarded the 2007 Nobel Memorial Prize in Economic Sciences with Leonid Hurwicz and Roger Myerson "for having laid the foundations of mechanism design theory". He is the Adams University Professor and Professor of Economics and Mathematics at Harvard University.

<span class="mw-page-title-main">Roger Myerson</span> American mathematician

Roger Bruce Myerson is an American economist and professor at the University of Chicago. He holds the title of the David L. Pearson Distinguished Service Professor of Global Conflict Studies at The Pearson Institute for the Study and Resolution of Global Conflicts in the Harris School of Public Policy, the Griffin Department of Economics, and the college. Previously, he held the title The Glen A. Lloyd Distinguished Service Professor of Economics. In 2007, he was the winner of the Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel with Leonid Hurwicz and Eric Maskin for "having laid the foundations of mechanism design theory." He was elected a Member of the American Philosophical Society in 2019.

Algorithmic game theory (AGT) is an area in the intersection of game theory and computer science, with the objective of understanding and design of algorithms in strategic environments.

In social choice theory, a dictatorship mechanism is a rule by which, among all possible alternatives, the results of voting mirror a single predetermined person's preferences, without consideration of the other voters. Dictatorship by itself is not considered a good mechanism in practice, but it is theoretically important: by Arrow's impossibility theorem, when there are at least three alternatives, dictatorship is the only ranked voting electoral system that satisfies unrestricted domain, Pareto efficiency, and independence of irrelevant alternatives. Similarly, by Gibbard's theorem, when there are at least three alternatives, dictatorship is the only strategyproof rule.

<span class="mw-page-title-main">Kevin W. S. Roberts</span> British economist

Kevin W. S. Roberts was the Sir John Hicks Professor of Economics at the University of Oxford until his retirement in 2020.

Maximal lotteries are a tournament voting rule that elects the majority-preferred candidate if one exists, and otherwise elects a candidate from the majority-preferred set by a randomized voting procedure. The method selects the probability distribution of candidates that a majority of voters would prefer to any other.

Hervé Moulin is a French mathematician who is the Donald J. Robertson Chair of Economics at the Adam Smith Business School at the University of Glasgow. He is known for his research contributions in mathematical economics, in particular in the fields of mechanism design, social choice, game theory and fair division. He has written five books and over 100 peer-reviewed articles.

In mechanism design, monotonicity is a property of a social choice function. It is a necessary condition for being able to implement the function using a strategyproof mechanism. Its verbal description is:

If changing one agent's type changes the outcome under the social choice function, then the resulting difference in utilities of the new and original outcomes evaluated at the new type of this agent must be at least as much as this difference in utilities evaluated at the original type of this agent.

Guoqiang Tian is a Chinese-American economist. He is the Alfred F. Chalk Professor of Economics at Texas A&M University. He is Honorary Dean of Institute for Advanced Research at Shanghai University of Finance and Economics.

Fractional social choice is a branch of social choice theory in which the collective decision is not a single alternative, but rather a weighted sum of two or more alternatives. For example, if society has to choose between three candidates: A B or C, then in standard social choice, exactly one of these candidates is chosen, while in fractional social choice, it is possible to choose "2/3 of A and 1/3 of B".

References

  1. 1 2 3 4 5 6 7 8 9 "Planning Unit, Indian Statistical Institute".
  2. 1 2 3 "CV" (PDF).
  3. ↑ Sen, Arunava (2008). "Arunava Sen on Hugo F. Sonnenschein". In Jackson, Matthew O.; McLennan, Andrew (eds.). Foundations in Microeconomic Theory . Springer Berlin Heidelberg. pp.  377–394. doi:10.1007/978-3-540-74057-5_18. ISBN   978-3-540-74057-5.{{cite book}}: |work= ignored (help)
  4. 1 2 "Scientific Background Document of 2007 Nobel prize in Economics" (PDF).
  5. 1 2 3 4 Maskin, Eric (1 January 1999). "Nash Equilibrium and Welfare Optimality*". The Review of Economic Studies. 66 (1): 23–38. doi:10.1111/1467-937X.00076. ISSN   0034-6527. S2CID   16282419.
  6. ↑ Dutta, Bhaskar; Sen, Arunava (1 January 1991). "A Necessary and Sufficient Condition for Two-Person Nash Implementation". The Review of Economic Studies. 58 (1): 121–128. doi:10.2307/2298049. ISSN   0034-6527. JSTOR   2298049.
  7. 1 2 Sen, Arunava; Abreu, Dilip (July 1991). "Virtual Implementation in Nash Equilibrium". Econometrica. 59 (4). The Econometric Society. Retrieved 4 January 2023.
  8. ↑ Abreu, Dilip; Sen, Arunava (1 April 1990). "Subgame perfect implementation: A necessary and almost sufficient condition". Journal of Economic Theory. 50 (2): 285–299. doi:10.1016/0022-0531(90)90003-3. ISSN   0022-0531.
  9. ↑ Moore, John; Repullo, Rafael (1988). "Subgame Perfect Implementation". Econometrica. 56 (5): 1191–1220. doi:10.2307/1911364. ISSN   0012-9682. JSTOR   1911364.
  10. ↑ Dutta, Bhaskar; Sen, Arunava (1 January 2012). "Nash implementation with partially honest individuals" (PDF). Games and Economic Behavior. 74 (1): 154–169. doi:10.1016/j.geb.2011.07.006. ISSN   0899-8256.
  11. 1 2 Mukherjee, Saptarshi; Muto, Nozomu; Ramaekers, Eve; Sen, Arunava (1 March 2019). "Implementation in undominated strategies by bounded mechanisms: The Pareto correspondence and a generalization". Journal of Economic Theory. 180: 229–243. doi:10.1016/j.jet.2018.12.010. ISSN   0022-0531. S2CID   46181914.
  12. ↑ Börgers, T. (1 February 1991). "Undominated strategies and coordination in normalform games". Social Choice and Welfare. 8 (1): 65–78. doi:10.1007/BF00182448. ISSN   1432-217X. S2CID   154206185.
  13. ↑ Jackson, Matthew O. (1 September 1992). "Implementation in Undominated Strategies: A Look at Bounded Mechanisms". The Review of Economic Studies. 59 (4): 757–775. doi:10.2307/2297996. hdl: 10419/221192 . ISSN   0034-6527. JSTOR   2297996.
  14. ↑ Aswal, Navin; Chatterji, Shurojit; Sen, Arunava (1 August 2003). "Dictatorial domains". Economic Theory. 22 (1): 45–62. doi:10.1007/s00199-002-0285-8. ISSN   1432-0479. S2CID   14208937.
  15. ↑ Chatterji, Shurojit; Sen, Arunava; Zeng, Huaxia (2016). "A characterization of single-peaked preferences via random social choice functions". Theoretical Economics. 11 (2): 711–733. doi: 10.3982/TE1972 . hdl: 10419/150291 . ISSN   1555-7561.
  16. ↑ Chatterji, Shurojit; Sanver, Remzi; Sen, Arunava (1 May 2013). "On domains that admit well-behaved strategy-proof social choice functions". Journal of Economic Theory. 148 (3): 1050–1073. doi:10.1016/j.jet.2012.10.005. ISSN   0022-0531. S2CID   10219864.
  17. ↑ Chatterji, Shurojit; Sen, Arunava; Zeng, Huaxia (1 July 2014). "Random dictatorship domains". Games and Economic Behavior. 86: 212–236. doi:10.1016/j.geb.2014.03.017. ISSN   0899-8256. S2CID   16375238.
  18. 1 2 3 Majumdar, Dipjyoti; Sen, Arunava (2004). "Ordinally Bayesian Incentive Compatible Voting Rules". Econometrica. 72 (2): 523–540. doi:10.1111/j.1468-0262.2004.00499.x. ISSN   1468-0262.
  19. 1 2 D'Aspremont, Claude; Gevers, Louis (1 June 1977). "Equity and the Informational Basis of Collective Choice". The Review of Economic Studies. 44 (2): 199–209. doi:10.2307/2297061. ISSN   0034-6527. JSTOR   2297061.
  20. ↑ Bhargava, Mohit; Majumdar, Dipjyoti; Sen, Arunava (2015). "Incentive-compatible voting rules with positively correlated beliefs". Theoretical Economics. 10 (3): 867–885. doi: 10.3982/TE1529 . hdl: 10419/150265 . ISSN   1555-7561.
  21. ↑ Breton, Michel Le; Sen, Arunava (1999). "Separable Preferences, Strategyproofness, and Decomposability". Econometrica. 67 (3): 605–628. doi:10.1111/1468-0262.00038. ISSN   1468-0262.
  22. ↑ Chatterji, Shurojit; Roy, Souvik; Sen, Arunava (1 December 2012). "The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences". Journal of Mathematical Economics. 48 (6): 353–366. doi:10.1016/j.jmateco.2012.08.001. ISSN   0304-4068. S2CID   53120916.
  23. ↑ Dutta, Bhaskar; Peters, Hans; Sen, Arunava (1 January 2007). "Strategy-proof Cardinal Decision Schemes" (PDF). Social Choice and Welfare. 28 (1): 163–179. doi:10.1007/s00355-006-0152-9. ISSN   1432-217X. S2CID   11874990.
  24. 1 2 Bikhchandani, Sushil; Chatterji, Shurojit; Lavi, Ron; Mu'alem, Ahuva; Nisan, Noam; Sen, Arunava (2006). "Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation" (PDF). Econometrica. 74 (4): 1109–1132. doi:10.1111/j.1468-0262.2006.00695.x. ISSN   1468-0262. S2CID   6210226.
  25. 1 2 Mishra, Debasis; Sen, Arunava (1 May 2012). "Robertsʼ Theorem with neutrality: A social welfare ordering approach". Games and Economic Behavior. 75 (1): 283–298. CiteSeerX   10.1.1.761.390 . doi:10.1016/j.geb.2011.11.005. ISSN   0899-8256. S2CID   7570821.
  26. ↑ Nath, Swaprava; Sen, Arunava (31 July 2015). "Affine maximizers in domains with selfish valuations". ACM Transactions on Economics and Computation. 3 (4): 1–19. doi:10.1145/2786014. S2CID   7068658.
  27. ↑ Sen, Arunava (1 March 2001). "Another direct proof of the Gibbard–Satterthwaite Theorem". Economics Letters. 70 (3): 381–385. doi:10.1016/S0165-1765(00)00362-1. ISSN   0165-1765.
  28. ↑ Sen, Arunava (1 December 2011). "The Gibbard random dictatorship theorem: a generalization and a new proof". SERIEs. 2 (4): 515–527. doi: 10.1007/s13209-011-0041-z . hdl: 10419/77778 . ISSN   1869-4195.
  29. 1 2 Goswami, Mridu Prabal; Mitra, Manipushpak; Sen, Arunava (2014). "Strategy proofness and Pareto efficiency in quasilinear exchange economies". Theoretical Economics. 9 (2): 361–381. doi: 10.3982/TE1214 . ISSN   1555-7561.
  30. ↑ "Today's Paper / NATIONAL : Subrahmanyam, Chaudhuri get Infosys Prize". The Hindu. 24 November 2012. Retrieved 24 November 2012.
  31. ↑ "Infosys Prize - Laureates 2012 - Prof. Arunava Sen".
  32. ↑ "Arunava Sen wins TWAS-Siwei Cheng Prize". TWAS. 15 December 2017. Retrieved 24 November 2019.
  33. ↑ "Infosys Prize - Laureates 2018 - Prof. Kavita Singh". www.infosys-science-foundation.com. Retrieved 24 November 2019.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.