DOCSLIB.ORG

Finding Strategyproof Social Choice Functions Via SAT Solving

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Finding Strategyproof Social Choice Functions Via SAT Solving Finding Strategyproof Social Choice Functions via SAT Solving ∗ Felix Brandt Christian Geist Technische Universität München Technische Universität München Munich, Germany Munich, Germany [email protected] [email protected] ABSTRACT due to Tang and Lin [19], who reduce well-known impos- A promising direction in computational social choice is to sibility results such as Arrow's theorem to finite instances, address open research problems using computer-aided prov- which can then be checked by a satisfiability (SAT) solver ing techniques. In conjunction with SAT solving, this ap- [3]. Geist and Endriss [13] were able to extend this method proach has been shown to be viable in the context of classic to a fully-automatic search algorithm for impossibility the- impossibility theorems such as Arrow's impossibility as well orems in the context of preference relations over sets of al- as axiomatizations of preference extensions. In this paper, ternatives. In this paper, we apply these techniques to im- we demonstrate that it can also be applied to the more com- prove our understanding of strategyproofness in the context plex notion of strategyproofness for irresolute social choice of set-valued (or so-called irresolute) social choice functions. functions. These types of problems, however, require a more These types of problems, however, are more complex and evolved encoding as otherwise the search space rapidly be- require an evolved encoding as otherwise the search space comes much too large. We present an efficient encoding for rapidly becomes too large. Table 1 illustrates how quickly translating such problems to SAT and leverage this encoding the number of involved objects grows and that, therefore, to prove new results about strategyproofness with respect to an exhaustive search is doomed to fail. Kelly's and Fishburn's preference extensions. For example, Formally, a social choice function (SCF) is defined as a we show that no Pareto-optimal majoritarian social choice function that maps individual preferences over a set of al- function satisfies Fishburn-strategyproofness. ternatives to a set of socially most preferred alternatives. An SCF is strategyproof if no agent can obtain a more pre- ferred outcome by misrepresenting her preferences. It is Categories and Subject Descriptors well-known from the Gibbard-Satterthwaite theorem that, [Applied computing]: Economics; [Computing when restricting attention to SCFs that always return a sin- 1 methodologies]: Artificial intelligence gle alternative, only trivial SCFs can be strategyproof. A proper definition of strategyproofness for the more general setting of irresolute SCFs requires the specification of pref- General Terms erences over sets of alternatives. Rather than asking the Economics, Theory, Verification, Algorithms agents to specify their preferences over all sets (which would be bound to various rationality constraints), it is typically assumed that the preferences over single alternatives can Keywords be extended to preferences over sets. Of course, there are Computer-aided theorem proving, strategyproofness, tour- various ways how to extend preferences to sets (see, e.g., nament solutions, set extensions, SAT [12, 2, 20]), each of which leads to a different class of strat- egyproof SCFs. A function that yields a preference relation 1. INTRODUCTION over subsets of alternatives when given a preference relation over single alternatives is called a set extension or preference Ever since the famous Four Color Problem was solved us- extension. In this paper, we focus on two very natural set ing a computer-assisted approach, it is clear that computers extensions due to Kelly [14] and Fishburn [9]2. can contribute significantly to finding and proving formal statements. Due to its rigorous axiomatic foundation, so- 1The assumption of single-valuedness has been criticized for cial choice theory appears to be a field in which computer- being restrictive and unreasonable (see, e.g., [11, 14, 20]). aided theorem proving is a particularly promising line of 2G¨ardenfors [12] attributed this extension to Fishburn be- research. Perhaps the best known result in this context is Alternatives 4 5 6 7 ∗Corresponding author Choice sets 15 31 63 127 Tournaments 64 1,024 32,768 ∼ 2 · 106 Appears in: Alessio Lomuscio, Paul Scerri, Ana Bazzan, Canonical tourn. 4 12 56 456 and Michael Huhns (eds.), Proceedings of the 13th Inter- Maj. SCFs 50; 625 ∼ 1018 ∼ 10101 ∼ 10959 national Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014), May 5-9, 2014, Paris, France. Table 1: Number of objects involved in problems Copyright c 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. with irresolute majoritarian SCFs While strategyproofness for Kelly's extension (henceforth Definition 1. A social choice function (SCF) is a func- Kelly-strategyproofness) is known to be a rather restrictive tion f : R∗(A) ! 2A n ;. condition [14, 1, 18], some SCFs such as the Pareto rule, ∗ the omninomination rule, the top cycle, the minimal cov- An SCF is resolute if jf(R)j = 1 for all R 2 R (A), otherwise ering set, and the bipartisan set were shown to be Kelly- it is irresolute. strategyproof [6]. Interestingly, the more discriminating of We restrict our attention to majoritarian SCFs (or tour- these SCFs are majoritarian, i.e., they are based on the pair- nament solutions), which are defined using the majority re- wise majority relation only, and, moreover, can be ordered lation. The majority relation (or: majority graph) RM of a with respect to set inclusion. In particular, these results preference profile R is the relation on A × A defined by suggest that the bipartisan set may be the finest Kelly- (a; b) 2 RM iff w(a; b) ≥ 0, for all alternatives a; b 2 A. strategyproof majoritarian SCF. In this paper, we show that this not the case by automatically generating a Kelly- An SCF f is said to be majoritarian if it is neutral5 and its strategyproof SCF which is strictly contained in the bipar- outcome only depends on the (unweighted) majority com- tisan set. parisons between pairs of alternatives, i.e., f(R) = f(R0) 0 For the more demanding notion of Fishburn- whenever RM = RM . strategyproofness, existing results suggested that it may We will now introduce the majoritarian SCFs considered only be satisfied by rather indiscriminating SCFs such as in this paper (see [15, 5], for more information). the top cycle [7, 8].3 Using our computer-aided proving technique we were able to confirm this suspicion by proving Top Cycle The top cycle rule TC (also known as weak that, within the domain of majoritarian SCFs, Fishburn- closure maximality, GETCHA, or the Smith set) returns the strategyproofness is incompatible with Pareto-optimality. maximal elements of RM . In order to achieve this impossibility, we manually proved Uncovered Set Let C denote the covering relation on a novel characterization of Pareto-optimal majoritarian A × A, i.e., a C b (\a covers b") if and only if b RM b and SCFs and an induction step, which allows us to generalize b RM x implies a RM x for all x 2 A. The uncovered set UC the computer-verified impossibility to larger numbers of returns the maximal elements of C, i.e., those alternatives alternatives. that are not covered by any other alternative. The universality of our method and its ease of adaptation suggests that it could be applied to similar open questions Bipartisan Set Consider the symmetric two-player zero- in the future. sum game in which the set of actions for both players is given by A and payoffs are defined as follows. If the first player chooses a and the second player chooses b, the payoff 2. MATHEMATICAL FRAMEWORK OF for the first player is 1 if a RM b, −1 if b RM a, and 0 oth- STRATEGYPROOFNESS erwise. The bipartisan set BP contains all alternatives that In this section, we provide the terminology and notation are played with positive probability in some Nash equilib- required for our results and introduce notions of strate- rium of this game. gyproofness for majoritarian SCFs that allow us to abstract An SCF f is called a refinement of another SCF g if away any reference to preference profiles. f(R) ⊆ g(R) for all preference profiles R. In short, we write f ⊆ g in this case. It can be shown for the above 2.1 Social Choice Functions that BP ⊆ UC ⊆ TC (see, e.g., Laslier [15]). Let N = f1; : : : ; ng be a set of at least 3 voters with preferences over a finite set A of m alternatives. For conve- 2.2 Strategyproofness 4 nience, we assume that n is odd. The preferences of each Even though our investigation of strategyproof SCFs is voter i 2 N are represented by a complete, anti-symmetric, universal in the sense that it can be applied to any set exten- and transitive preference relation Ri ⊆ A × A. The inter- sion, in this paper we will concentrate on two well-known set pretation of (a; b) 2 Ri, usually denoted by a Ri b, is that extensions due to Kelly [14] and Fishburn [9], respectively. voter i values alternative a at least as much as alternative b. They are defined as follows: Let Ri be a preference relation The set of all preference relations over A will be denoted over A and X; Y ⊆ A two nonempty subsets of A. by R(A). The set of preference profiles, i.e., finite vectors of ∗ K preference relations, is then given by R (A). The typical ele- XRi Y iff x Ri y for all x 2 X and all y 2 Y [14] ∗ ment of R (A) will be R = (R1;:::;Rn). In accordance with One interpretation of this extension is that voters are com- conventional notation, we write Pi for the strict part of Ri, pletely unaware of the mechanism (e.g., a lottery) that will i.e., a Pi b if a Ri b but not b Ri a.
Load more

Recommended publications
  • California Institute of Technology
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Caltech Authors - Main DIVISION OF THE HUM ANITIES AND SO CI AL SCIENCES CALIFORNIA INSTITUTE OF TECHNOLOGY PASADENA, CALIFORNIA 91125 IMPLEMENTATION THEORY Thomas R. Palfrey � < a: 0 1891 u. "')/,.. () SOCIAL SCIENCE WORKING PAPER 912 September 1995 Implementation Theory Thomas R. Palfrey Abstract This surveys the branch of implementation theory initiated by Maskin (1977). Results for both complete and incomplete information environments are covered. JEL classification numbers: 025, 026 Key words: Implementation Theory, Mechanism Design, Game Theory, Social Choice Implementation Theory* Thomas R. Palfrey 1 Introduction Implementation theory is an area of research in economic theory that rigorously investi­ gates the correspondence between normative goals and institutions designed to achieve {implement) those goals. More precisely, given a normative goal or welfare criterion for a particular class of allocation pro blems (or domain of environments) it formally char­ acterizes organizational mechanisms that will guarantee outcomes consistent with that goal, assuming the outcomes of any such mechanism arise from some specification of equilibrium behavior. The approaches to this problem to date lie in the general domain of game theory because, as a matter of definition in the implementation theory litera­ ture, an institution is modelled as a mechanism, which is essentially a non-cooperative game. Moreover, the specific models of equilibrium behavior
    [Show full text]
  • Game Theory 2021
    More Mechanism Design Game Theory 2021 Game Theory 2021 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 More Mechanism Design Game Theory 2021 Plan for Today In this second lecture on mechanism design we are going to generalise beyond the basic scenario of auctions|as much as we can manage: • Revelation Principle: can focus on direct-revelation mechanisms • formal model of direct-revelation mechanisms with money • incentive compatibility of the Vickrey-Clarke-Groves mechanism • other properties of VCG for special case of combinatorial auctions • impossibility of achieving incentive compatibility more generally Much of this is also (somewhat differently) covered by Nisan (2007). N. Nisan. Introduction to Mechanism Design (for Computer Scientists). In N. Nisan et al. (eds.), Algorithmic Game Theory. Cambridge University Press, 2007. Ulle Endriss 2 More Mechanism Design Game Theory 2021 Reminder Last time we saw four auction mechanisms for selling a single item: English, Dutch, first-price sealed-bid, Vickrey. The Vickrey auction was particularly interesting: • each bidder submits a bid in a sealed envelope • the bidder with the highest bid wins, but pays the price of the second highest bid (unless it's below the reservation price) It is a direct-revelation mechanism (unlike English and Dutch auctions) and it is incentive-compatible, i.e., truth-telling is a dominant strategy (unlike for Dutch and FPSB auctions). Ulle Endriss 3 More Mechanism Design Game Theory 2021 The Revelation Principle Revelation Principle: Any outcome that is implementable in dominant strategies via some mechanism can also be implemented by means of a direct-revelation mechanism making truth-telling a dominant strategy.
    [Show full text]
  • Designing Mechanisms to Make Welfare- Improving Strategies Focal∗
    Designing Mechanisms to Make Welfare- Improving Strategies Focal∗ Daniel E. Fragiadakis Peter Troyan Texas A&M University University of Virginia Abstract Many institutions use matching algorithms to make assignments. Examples include the allocation of doctors, students and military cadets to hospitals, schools and branches, respec- tively. Most of the market design literature either imposes strong incentive constraints (such as strategyproofness) or builds mechanisms that, while more efficient than strongly incentive compatible alternatives, require agents to play potentially complex equilibria for the efficiency gains to be realized in practice. Understanding that the effectiveness of welfare-improving strategies relies on the ease with which real-world participants can find them, we carefully design an algorithm that we hypothesize will make such strategies focal. Using a lab experiment, we show that agents do indeed play the intended focal strategies, and doing so yields higher overall welfare than a common alternative mechanism that gives agents dominant strategies of stating their preferences truthfully. Furthermore, we test a mech- anism from the field that is similar to ours and find that while both yield comparable levels of average welfare, our algorithm performs significantly better on an individual level. Thus, we show that, if done carefully, this type of behavioral market design is a worthy endeavor that can most promisingly be pursued by a collaboration between institutions, matching theorists, and behavioral and experimental economists. JEL Classification: C78, C91, C92, D61, D63, Keywords: dictatorship, indifference, matching, welfare, efficiency, experiments ∗We are deeply indebted to our graduate school advisors Fuhito Kojima, Muriel Niederle and Al Roth for count- less conversations and encouragement while advising us on this project.
    [Show full text]
  • Strategyproof Exchange with Multiple Private Endowments
    Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Strategyproof Exchange with Multiple Private Endowments Taiki Todo, Haixin Sun, Makoto Yokoo Dept. of Informatics Kyushu University Motooka 744, Fukuoka, JAPAN ftodo, sunhaixin, [email protected] Abstract efficient and individually rational. Moreover, it is the only We study a mechanism design problem for exchange rule that satisfies those three properties (Ma 1994). Due to economies where each agent is initially endowed with these advantages, TTC has been attracting much attention a set of indivisible goods and side payments are not al- from both economists and computer scientists. lowed. We assume each agent can withhold some en- In this paper we consider exchange economies where each dowments, as well as misreport her preference. Under this assumption, strategyproofness requires that for each agent is endowed with a set of multiple goods, instead of agent, reporting her true preference with revealing all a single good. Under that model, Pareto efficiency, indi- her endowments is a dominant strategy, and thus implies vidual rationality, and strategyproofness cannot be simulta- individual rationality. Our objective in this paper is to neously satisfied (Sonmez¨ 1999). Therefore, one main re- analyze the effect of such private ownership in exchange search direction on exchanges with multiple endowments is economies with multiple endowments. As fundamental to achieve strategyproof rules that guarantee a limited notion results, we first show that the revelation principle holds of efficiency. In particular, Papai´ (2003) defined a class of under a natural assumption and that strategyproofness exchange rules and gave a characterization by strategyproof- and Pareto efficiency are incompatible even under the ness and individual rationality with some other weak effi- lexicographic preference domain.
    [Show full text]
  • Proportionality and Strategyproofness in Multiwinner Elections
    Session 43: Social Choice Theory 3 AAMAS 2018, July 10-15, 2018, Stockholm, Sweden Proportionality and Strategyproofness in Multiwinner Elections Dominik Peters University of Oxford Oxford, UK [email protected] ABSTRACT focussed on cases where there are no parties, and preferences are Multiwinner voting rules can be used to select a fixed-size com- expressed directly over the candidates [23]. The latter setting allows mittee from a larger set of candidates. We consider approval-based for applications in areas outside the political sphere, such as in committee rules, which allow voters to approve or disapprove can- group recommendation systems. didates. In this setting, several voting rules such as Proportional To formalise the requirement of proportionality in this party-free Approval Voting (PAV) and Phragmén’s rules have been shown to setting, it is convenient to consider the case where input preferences produce committees that are proportional, in the sense that they are given as approval ballots: each voter reports a set of candidates proportionally represent voters’ preferences; all of these rules are that they find acceptable. Even for this simple setting, there isa strategically manipulable by voters. On the other hand, a generalisa- rich variety of rules that exhibit different behaviour [31], and this tion of Approval Voting gives a non-proportional but strategyproof setting gives rise to a rich variety of axioms. voting rule. We show that there is a fundamental tradeoff between One natural way of selecting a committee of k candidates when these two properties: we prove that no multiwinner voting rule can given approval ballots is to extend Approval Voting (AV): for each simultaneously satisfy a weak form of proportionality (a weakening of the m candidates, count how many voters approve them (their of justified representation) and a weak form of strategyproofness.
    [Show full text]
  • Relaxing Strategyproofness in One-Sided Matching
    Relaxing Strategyproofness in One-sided Matching TIMO MENNLE and SVEN SEUKEN University of Zurich We consider the one-sided matching problem, where agents must be matched to indivisible ob- jects. Our first result is a novel characterization of strategyproof mechanisms by three intuitive axioms. Furthermore, we introduce partial strategyproofness, a new relaxation of strategyproof- ness that bridges the gap between full and weak strategyproofness. Partial strategyproofness finds application in the incentive analysis of non-strategyproof mechanisms, such as Probabilistic Serial, different variants of the Boston mechanism, and hybrid mechanisms. In this letter, we summarize the main results from [Mennle and Seuken 2014a] and demonstrate how they can be used for the design and analysis of matching mechanisms.1 Categories and Subject Descriptors: J.4.a [Social and Behavioral Sciences]: Economics General Terms: Economics; Theory Additional Key Words and Phrases: Matching, Mechanism Design, Strategyproofness 1. INTRODUCTION The (probabilistic) one-sided matching problem is concerned with the allocation of indivisible goods to self-interested agents with privately known preferences in domains where monetary transfers are not permitted. Such problems often arise in situations that are of great importance to peoples' lives. For example, students must be matched to schools, teachers to training programs, or tenants to houses. Strategyproof mechanisms, such as Random Serial Dictatorship (RSD), are ap- pealing because they make truthful reporting a dominant strategy for all agents. Participation in the mechanism becomes an easy task as there is no need for delib- eration about the best response, thus reducing cognitive costs for the agents and (likely) endowing the mechanism with correct information about agents' preferences.
    [Show full text]
  • Specification Faithfulness in Networks with Rational Nodes
    Specification Faithfulness in Networks with Rational Nodes Jeffrey Shneidman, David C. Parkes Division of Engineering and Applied Sciences, Harvard University, 33 Oxford Street, Cambridge MA 02138 {jeffsh, parkes}@eecs.harvard.edu ABSTRACT drive up their “contributed computation” credit [15]. There It is useful to prove that an implementation correctly follows is interesting work documenting the “free rider” problem [1] a specification. But even with a provably correct implemen- and the “tragedy of the commons” [12] in a data centric peer tation, given a choice, would a node choose to follow it? This to peer setting. paper explores how to create distributed system specifica- This behavior can be classified as a type of failure, which tions that will be faithfully implemented in networks with should stand independently from other types of failures in rational nodes, so that no node will choose to deviate. Given distributed systems and is indicative of an underlying in- a strategyproof centralized mechanism, and given a network centive problem in a system’s design when run on a network of nodes modeled as having rational-manipulation faults, with rational nodes. Whereas traditional failure models are we provide a proof technique to establish the incentive-, overcome by relying on redundancy, rational manipulation communication-, and algorithm-compatibility properties that can also be overcome with design techniques such as prob- guarantee that participating nodes are faithful to a sug- lem partitioning, catch-and-punish, and incentives. In such gested specification. As a case study, we apply our methods a network one can state a strong claim about the faithfulness to extend the strategyproof interdomain routing mechanism of each node’s implementation.
    [Show full text]
  • Approximate Strategyproofness
    Approximate Strategyproofness The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Benjamin Lubin and David C. Parkes. 2012. Approximate strategyproofness. Current Science 103, no. 9: 1021-1032. Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:11879945 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#OAP Approximate Strategyproofness Benjamin Lubin David C. Parkes School of Management School of Engineering and Applied Sciences Boston University Harvard University [email protected] [email protected] July 24, 2012 Abstract The standard approach of mechanism design theory insists on equilibrium behavior by par- ticipants. This assumption is captured by imposing incentive constraints on the design space. But in bridging from theory to practice, it often becomes necessary to relax incentive constraints in order to allow tradeo↵s with other desirable properties. This paper surveys a number of dif- ferent options that can be adopted in relaxing incentive constraints, providing a current view of the state-of-the-art. 1 Introduction Mechanism design theory formally characterizes institutions for the purpose of establishing rules that engender desirable outcomes in settings with multiple, self-interested agents each with private information about their preferences. In the context of mechanism design, an institution is formalized as a framework wherein messages are received from agents and outcomes selected on the basis of these messages.
    [Show full text]
  • Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness
    Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness Sophie Bade Yannai A. Gonczarowski ∗ March 18, 2017 Abstract The Gibbard-Satterthwaite Impossibility Theorem (Gibbard, 1973; Satterthwaite, 1975) holds that dictatorship is the only Pareto optimal and strategyproof social choice function on the full domain of preferences. Much of the work in mechanism design aims at getting around this impossibility theorem. Three grand success stories stand out. On the domains of single peaked preferences, of house matching, and of quasilinear pref- erences, there are appealing Pareto optimal and strategyproof social choice functions. We investigate whether these success stories are robust to strengthening strategyproof- ness to obvious strategyproofness, recently introduced by Li(2015). A social choice function is obviously strategyproof (OSP) implementable if even cognitively limited agents can recognize their strategies as weakly dominant. For single peaked preferences, we characterize the class of OSP-implementable and unanimous social choice functions as dictatorships with safeguards against extremism | mechanisms (which turn out to also be Pareto optimal) in which the dictator can choose the outcome, but other agents may prevent the dictator from choosing an outcome that is too extreme. Median voting is consequently not OSP-implementable. Indeed, the only OSP-implementable quantile rules choose either the minimal or the maximal ideal point. For house matching, we characterize the class of OSP-implementable and Pareto optimal matching rules as sequential barter with lurkers | a significant generalization over bossy variants of bipolar serially dictatorial rules. While Li(2015) shows that second-price auctions are OSP-implementable when only one good is sold, we show that this positive result does not extend to the case of multiple goods.
    [Show full text]
  • Approximation Algorithms and Mechanism Design for Minimax Approval Voting
    Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10) Approximation Algorithms and Mechanism Design for Minimax Approval Voting Ioannis Caragiannis Dimitris Kalaitzis Evangelos Markakis RACTI & Department of Computer RACTI & Department of Computer Department of Informatics Engineering and Informatics Engineering and Informatics Athens University of Economics University of Patras, Greece University of Patras, Greece & Business, Greece [email protected] [email protected] [email protected] Abstract fined size k. Then the minisum solution consists of the k candidates with the highest number of approvals. We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the out- This solution however may ignore some voters’ prefer- come consists of a set of k candidates for some parameter ences in certain instances and does not take fairness issues k, e.g., committee elections. We are interested in the min- into account. We demonstrate this with the following exam- imax approval voting rule in which the outcome represents ple with four voters, five candidates, and k = 2. Each row a compromise among the voters, in the sense that the max- represents the preference of the corresponding voter. The imum distance between the preference of any voter and the minisum solution contains the candidates {a, b}. The dis- outcome is as small as possible. This voting rule has two tances of the voters from this outcome are 1, 0, 2, and 5 for main drawbacks. First, computing an outcome that minimizes voters 1, 2, 3, and 4, respectively (counting the number of the maximum distance is computationally hard.
    [Show full text]
  • 13Th Annual Conference
    The Association for Public Economic Theory 13th Annual Conference Conference in Celebration of the 50th Anniversary of the Institute of Economics, Academia Sinica June 12-14, 2012 Academia Sinica, Taipei, Taiwan The Association for Public Economic Theory 13 th Annual Conference PET 12 The Association for Public Economic Theory 13th Annual Conference Conference in Celebration of the 50th Anniversary of the Institute of Economics, Academia Sinica June 12-14, 2012 Academia Sinica, Taipei, Taiwan Organizer: Association for Public Economic Theory (APET) Host: Institute of Economics, Academia Sinica Local Organizers: Institute of Economics, Academia Sinica Department of Economics, National Taiwan University Sponsors: National Science Council Foundation For The Advancement of Outstanding Scholarship Taiwan Economic Association i ii The Association for Public Economic Theory 13 th Annual Conference Table of Contents Sponsors ……………………………………………………………………………………………………..i Organizing and Program Committees ……………………….……………………………...2 Welcome Message …………………………………………………………………..…………………3 General Conference Information …………………………………………………………….4-5 Schedule at a Glance ………….……………………………………………………..….………..6-7 Keynote Speakers ………………………………………………………………..……...…………8-10 PET12 Conference Program …………………………………………………….…………..11-54 Author Index ………..…………………………………………………………………….……….55-65 Building for Humanities and Social Sciences (BHSS Map) …………..……..66-77 Campus of Academia Sinica …………………………………………….……………………..78 Charter Bus Schedule ……..………………………………………………………..……………79 Taipei
    [Show full text]
  • Economics and Computation: Ad Auctions and Other Stories
    Economics and Computation: Ad Auctions and Other Stories Christopher Wilkens Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2013-66 http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-66.html May 15, 2013 Copyright © 2013, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Acknowledgement I want to thank those who have helped me reach this point --- my adviser Christos Papadimitriou for his incomparable wisdom and guidance; Kamal Jain and Aranyak Mehta for fantastic internships and advice; and many others at Berkeley, Microsoft, Google, ebay, MIT, and Sanford who have educated me. I also want to thank Darrell Hoy and Balasubramanian Sivan without whom many works in this thesis would have been shadows of their current forms. Last but not least, I want to thank my family and friends for setting a high standard, for making the educational process enjoyable, and for encouraging me to follow my passions even when my work was ``too simple'' or when ``nobody would hire me.'' Both proved false, but only through the many named and unnamed people who made this dissertation possible. Economics and Computation: Ad Auctions and Other Stories by Christopher A.
    [Show full text]