613 research outputs found
Acyclic Games and Iterative Voting
We consider iterative voting models and position them within the general
framework of acyclic games and game forms. More specifically, we classify
convergence results based on the underlying assumptions on the agent scheduler
(the order of players) and the action scheduler (which better-reply is played).
Our main technical result is providing a complete picture of conditions for
acyclicity in several variations of Plurality voting. In particular, we show
that (a) under the traditional lexicographic tie-breaking, the game converges
for any order of players under a weak restriction on voters' actions; and (b)
Plurality with randomized tie-breaking is not guaranteed to converge under
arbitrary agent schedulers, but from any initial state there is \emph{some}
path of better-replies to a Nash equilibrium. We thus show a first separation
between restricted-acyclicity and weak-acyclicity of game forms, thereby
settling an open question from [Kukushkin, IJGT 2011]. In addition, we refute
another conjecture regarding strongly-acyclic voting rules.Comment: some of the results appeared in preliminary versions of this paper:
Convergence to Equilibrium of Plurality Voting, Meir et al., AAAI 2010;
Strong and Weak Acyclicity in Iterative Voting, Meir, COMSOC 201
Constrained School Choice
Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the transition would lead to efficiency gains. The first two mechanisms are strategy-proof, but in practice student assignment procedures typically impede a student to submit a preference list that contains all his acceptable schools. We study the preference revelation game where students can only declare up to a fixed number of schools to be acceptable. We focus on the stability and efficiency of the Nash equilibrium outcomes. Our main results identify rather stringent necessary and sufficient conditions on the priorities to guarantee stability or efficiency of either of the two mechanisms. This stands in sharp contrast with the Boston mechanism which has been abandoned in many US school districts but nevertheless yields stable Nash equilibrium outcomes.school choice, matching, stability, Gale-Shapley deferred acceptance algorithm, top trading cycles, Boston mechanism, acyclic priority structure, truncation
Games of capacities : a (close) look to Nash Equilibria
The paper studies two games of capacity manipulation in hospital-intern markets. The focus is
on the stability of Nash equilibrium outcomes. We provide minimal necessary and sufficient
conditions guaranteeing the existence of pure strategy Nash Equilibria and the stability of
outcomes
Games with capacity manipulation : incentives and Nash equilibria
Studying the interaction between preference and capacity manipulation in matching markets, we prove that acyclicity is a necessary and sufficient condition that guarantees the stability of a Nash equilibrium and the strategy-proofness of truthful capacity revelation under the hospital-optimal and intern-optimal stable rules. We then introduce generalized capacity manipulations games where hospitals move first and state their capacities, and interns are subsequently assigned to hospitals using a sequential mechanism. In this setting, we first consider stable revelation mechanisms and introduce conditions guaranteeing the stability of the outcome. Next, we prove that every stable non-revelation mechanism leads to unstable allocations, unless restrictions on the preferences of the agents are introducedStable matching, Capacity, Nash equilibrium, Cycles
Acyclicity and singleton cores in matching markets
This paper analyzes the role of acyclicity in singleton cores. We show that the absence of simultaneous cycles is a sufficient condition for the existence of singleton cores. Furthermore, acyclicity in the preferences of either side of the market is a minimal condition that guarantees the existence of singleton cores. If firms or workers preferences are acyclical, unique stable matching is obtained through a procedure that resembles a serial dictatorship. Thus, acyclicity generalizes the notion of common preferences. It follows that if the firms or workers preferences are acyclical, unique stable matching is strongly efficient for the other side of the marketStable matching, Acyclicity, Singleton cores
Games of capacities : a (close) look to Nash Equilibria
The paper studies two games of capacity manipulation in hospital-intern markets. The focus is on the stability of Nash equilibrium outcomes. We provide minimal necessary and sufficient conditions guaranteeing the existence of pure strategy Nash Equilibria and the stability of outcomes.
Games of Capacities: A (Close) Look to Nash Equilibria
The paper studies two games of capacity manipulation in hospital-intern markets. The focus is on the stability of Nash equilibrium outcomes. We provide minimal necessary and sufficient conditions guaranteeing the existence of pure strategy Nash Equilibria and the stability of outcomes.Stable Matchings, Capacity, Nash Equilibrium, Cycles.
Acyclicity of improvements in finite game forms
Game forms are studied where the acyclicity, in a stronger or weaker sense, of (coalition or individual) improvements is ensured in all derivative games. In every game form generated by an ``ordered voting'' procedure, individual improvements converge to Nash equilibria if the players restrict themselves to ``minimal'' strategy changes. A complete description of game forms where all coalition improvement paths lead to strong equilibria is obtained: they are either dictatorial, or voting (or rather lobbing) about two outcomes. The restriction to minimal strategy changes ensures the convergence of coalition improvements to strong equilibria in every game form generated by a ``voting by veto'' procedure.Improvement dynamics; Game form; Perfect information game; Potential game; Voting by veto
- …