Trading Probability for Fairness ( Extended abstract )

نویسندگان

  • Marcin Jurdziński
  • Orna Kupferman
  • Thomas A. Henzinger
چکیده

Properties of open systems can be modeled as objectives in two-player games. Depending on the interaction between the system and its environment, the games may be either turn-based (transitions of the system and its environment are interleaved) or concurrent (transitions are taken simultaneously). Depending on the properties we model, the objectives may be achieved in a finite game (safety properties) or an infinite game (general properties, specified with Büchi, co-Büchi, or parity fairness conditions). Finally, winning may be required surely (the objective should be achieved for sure) or almost surely (the objective should be achieved with probability 1). Almost-sure winning involves randomized strategies for the players and is harder to analyze. For example, while sure reachability games can be solved in linear time, the best algorithm for solving almost-sure reachability is quadratic. In this paper it is shown that probabilistic concurrent games can be reduced to non-probabilistic turn-based games with a more general fairness condition. For example, finding the set of states that are almost-surely winning for player 1 in a concurrent reachability game can be reduced to finding the set of states that are surely winning for player 1 in a turn-based Büchi game. From a theoretical point of view, the reductions show that it is possible to trade the probabilistic nature of almost-sure winning by a more general fairness condition in a game with sure winning. The reductions improve our understanding of games and suggest alternative simple proofs of some known results such as determinacy of concurrent probabilistic Büchi games. From a practical point of view, our reductions turn solvers of non-probabilistic turn-based games into solvers of probabilistic concurrent games. An improvement in the well-studied algorithms for the former would immediately carry over to the latter. In particular, a recent improvement in the upper bound for non-probabilistic turn-based parity games allows us to improve the bound for solving probabilistic concurrent co-Büchi games from cubic to quadratic. Electrical Engineering and Computer Sciences, University of California, Berkeley. Email: [email protected] School of Computer Science and Engieneering, Hebrew University. Email: [email protected] Electrical Engineering and Computer Sciences, University of California, Berkeley. Email: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ranking the Trading Symbols of the Largest Companies Listed in the Tehran Stock Exchange Based on the Probability of Informed Trade Criteria

I n this paper, trading symbols of the 30 largest companies listed in the Tehran Stock Exchange (TSE) were ranked based on the asymmetry information risk. Using the Ersan and Alici (2016) modified clustering algorithm (EA), we estimated the probability of informed trading (PIN) to measure the asymmetry information among traders for each trading symbol and trading day through two-year...

متن کامل

Concepts of Fairness in the Global Trading System

How are we to assess the fairness of the global trading system as embodied in the GATT/WTO? Opinions about what constitutes fairness differ widely, and there is surely no incontrovertible yardstick. But can we be clearer about the criteria that are appropriate and what they mean in more operational terms? In this paper, we first discuss why fairness is a condition of the agreements among govern...

متن کامل

How Do Individuals’ Concern about Fairness and Ethical Idealism Correlate with Demand for Formal Procedures of Information

This paper examines the impact of tick size reduction on price continuity in the Taiwan stock market where employs call auction method throughout the entire trading day. Using the intraday data from September 1, 2004 to August 31, 2005, the results indicate that the price continuity of call stock market could be improved after tick size reduction. A smaller tick size is associated with a lower ...

متن کامل

QoS - Guaranteed Multiuser Scheduling in MIMO Broadcast Channels

© 2009 Seung Hwan Lee et al. 481 This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an ante...

متن کامل

Achieving Fairness in the Doha Development Round

The question addressed in this article is how the fairness of the global trading system as embodied in the GATT/WTO is to be assessed. Opinions about what constitutes fairness differ widely, and there is surely no incontrovertible yardstick. But it should be possible to be clearer about the criteria that are appropriate and what they mean in more operational terms. Why fairness is a condition o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002