Sunil Simon
YOU?
Author Swipe
View article: Boolean Observation Games
Boolean Observation Games Open
We introduce Boolean Observation Games, a subclass of multi-player finite strategic games with incomplete information and qualitative objectives. In Boolean observation games, each player is associated with a finite set of propositional va…
View article: Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games
Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games Open
Recently, in [K.R. Apt and S. Simon: Well-founded extensive games with perfect information, TARK21], we studied well-founded games, a natural extension of finite extensive games with perfect information in which all plays are finite. We ex…
View article: A tutorial for computer scientists on finite extensive games with perfect information
A tutorial for computer scientists on finite extensive games with perfect information Open
We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the …
View article: Boolean Observation Games
Boolean Observation Games Open
We introduce Boolean Observation Games, a subclass of multi-player finite strategic games with incomplete information and qualitative objectives. In Boolean observation games, each player is associated with a finite set of propositional va…
View article: Coordination Games on Weighted Directed Graphs
Coordination Games on Weighted Directed Graphs Open
We study strategic games on weighted directed graphs, where each player’s payoff is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed nonnegative integer bonus for picking a given…
View article: Well-Founded Extensive Games with Perfect Information
Well-Founded Extensive Games with Perfect Information Open
We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations …
View article: Well-Founded Extensive Games with Perfect Information
Well-Founded Extensive Games with Perfect Information Open
We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations …
View article: Analysis of Agricultural Policy Recommendations using Multi-Agent Systems
Analysis of Agricultural Policy Recommendations using Multi-Agent Systems Open
Despite agriculture being the primary source of livelihood for more than half of India's population, several socio-economic policies are implemented in the Indian agricultural sector without paying enough attention to the possible outcomes…
View article: Analysis of Agricultural Policy Recommendations using Multi-Agent\n Systems
Analysis of Agricultural Policy Recommendations using Multi-Agent\n Systems Open
Despite agriculture being the primary source of livelihood for more than half\nof India's population, several socio-economic policies are implemented in the\nIndian agricultural sector without paying enough attention to the possible\noutco…
View article: String Indexing for Top-k Close Consecutive Occurrences
String Indexing for Top-k Close Consecutive Occurrences Open
The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string P, report all occurrences of P within S. In this pap…
View article: Front Matter, Table of Contents, Preface, Conference Organization
Front Matter, Table of Contents, Preface, Conference Organization Open
Front Matter, Table of Contents, Preface, Conference Organization
View article: Graphical One-Sided Markets
Graphical One-Sided Markets Open
We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocation within the agent's local neighbourhood. …
View article: Graphical One-Sided Markets
Graphical One-Sided Markets Open
We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocation within the agent's local neighbourhood. …
View article: Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic Open
Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a n…
View article: Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic Open
Whether it be in normal form games, or in fair allocations, or in voter\npreferences in voting systems, a certain pattern of reasoning is common. From a\nparticular profile, an agent or a group of agents may have an incentive to\nshift to …
View article: PRODUCTIVITY OF RAINFED RICE (Oryza sativa L.) AS INFLUENCED BY CROP GEOMETRY IN THE CONTEXT OF CLIMATE CHANGE
PRODUCTIVITY OF RAINFED RICE (Oryza sativa L.) AS INFLUENCED BY CROP GEOMETRY IN THE CONTEXT OF CLIMATE CHANGE Open
View article: Synchronisation Games on Hypergraphs
Synchronisation Games on Hypergraphs Open
We study a strategic game model on hypergraphs where players, modelled by nodes, try to coordinate or anti-coordinate their choices within certain groups of players, modelled by hyperedges. We show this model to be a strict generalisation …
View article: Constrained Pure Nash Equilibria in Polymatrix Games
Constrained Pure Nash Equilibria in Polymatrix Games Open
We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on i…
View article: Efficient Local Search in Coordination Games on Graphs
Efficient Local Search in Coordination Games on Graphs Open
We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given strat…
View article: Coordination Games on Graphs
Coordination Games on Graphs Open
We introduce natural strategic games on graphs, which capture the idea of coordination in a local setting. We study the existence of equilibria that are resilient to coalitional deviations of unbounded and bounded size (i.e., strong equili…